{"type":"ScholarlyArticle","title":"Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems","authors":[{"name":"Pierre Lescanne","slug":"pierre-lescanne","given":"Pierre","family":"Lescanne","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1981/102","pdf":"https://ijcai.org/proceedings/1981/0102.pdf","markdown":"https://ijcai.org/proceedings/1981/102.md","bibtex":"https://ijcai.org/proceedings/1981/bibtex/102","volume":{"slug":"1981","title":"Proceedings of the Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1981","url":"https://ijcai.org/proceedings/1981/","year":1981,"location":"Vancouver, British Columbia, Canada","dates":"24-28 August 1981","editors":"Roger C. Schank","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Theorem Proving","track":"Theorem Proving","number":102,"pages":{"first":548,"last":549},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}