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

Lescanne, Pierre

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

Download BibTeX Cite

Proceedings of the Seventh International Joint Conference on Artificial Intelligence. Theorem Proving. Pages 548-549.

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.

Pierre Lescanne. 1981. Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems. In Proceedings of the Seventh International Joint Conference on Artificial Intelligence, IJCAI-81. IJCAI, 548–549. https://ijcai.org/proceedings/1981/102

@inproceedings{ijcai1981p102,
  title     = {Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems},
  author    = {Lescanne, Pierre},
  booktitle = {Proceedings of the Seventh International Joint Conference on
               Artificial Intelligence, {IJCAI-81}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Roger C. Schank},
  pages     = {548--549},
  year      = {1981},
  month     = {8},
  note      = {Theorem Proving},
  url       = {https://ijcai.org/proceedings/1981/102},
}

TY  - CPAPER
TI  - Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems
AU  - Lescanne, Pierre
T2  - Proceedings of the Seventh International Joint Conference on Artificial Intelligence, IJCAI-81
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1981
SP  - 548
EP  - 549
UR  - https://ijcai.org/proceedings/1981/102
ER  -