{"type":"ScholarlyArticle","title":"Universal Unification and Regular Equational ACFM Theories","authors":[{"name":"Jörg H. Siekmann","slug":"jorg-h-siekmann","given":"Jörg H.","family":"Siekmann","affiliation":""},{"name":"Peter Szabó","slug":"peter-szabo","given":"Peter","family":"Szabó","affiliation":""}],"abstract":"A universal minimal type conformal matchlng algorithm and a universal minimal unification algorithm based on [FA79J, [SL74J, [LB79J, [HUBOJ are presented for a restricted class of equational theories (the Regular ACFM Theories), i.e. it is shown that the set of most general unifiers is recursively enumerable for this class. The class of Regular ACFM Theories is wide enough to containmost special cases of unification algorithms that have been investigated so far. This paper is a (very) abbreviated version of [SS81cJ, all proofs and most of the technical material are omitted for lack of space . For reasons of consistency with the original paper, the numbering of definitions, lemmas and theorems has been retained.","doi":null,"url":"https://ijcai.org/proceedings/1981/100","pdf":"https://ijcai.org/proceedings/1981/0100.pdf","markdown":"https://ijcai.org/proceedings/1981/100.md","bibtex":"https://ijcai.org/proceedings/1981/bibtex/100","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":100,"pages":{"first":532,"last":537},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}