ML Anthology

Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems

Pierre Lescanne
IJCAI 1981 pp. 548-550
/ijcai/1981/lescanne1981ijcai-decomposition/

Abstract

Decomposition ordering is a well-founded monotonic ordering on terms. Because it has the subterm and the deletion properties, decomposition ordering is useful to prove termination of rewriting systems. An algorithm comparing two terms is given.

PDF Semantic Scholar

Cite

Text

Lescanne. "Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems." International Joint Conference on Artificial Intelligence, 1981.

Markdown

[Lescanne. "Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems." International Joint Conference on Artificial Intelligence, 1981.](https://mlanthology.org/ijcai/1981/lescanne1981ijcai-decomposition/)

BibTeX

@inproceedings{lescanne1981ijcai-decomposition,
  title     = {{Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems}},
  author    = {Lescanne, Pierre},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1981},
  pages     = {548-550},
  url       = {https://mlanthology.org/ijcai/1981/lescanne1981ijcai-decomposition/}
}