{"type":"ScholarlyArticle","title":"A Unification Algorithm for Infinite Trees","authors":[{"name":"Kuniaki Mukai","slug":"kuniaki-mukai","given":"Kuniaki","family":"Mukai","affiliation":""}],"abstract":"A simple unification algorithm for infinite trees has been developed. The algorithm i s designed to work efficiently under structure sh a ring implementa tions of logic programming languages, e.g., Prolog (Warren [3)). A relation, called \"is covered with\", betw ee n two terms is introduced to terminate the a lgorithm. The fund a mental operations are to comp ute the frontier set of two given terms and to test the relation between them. A termination proof is shown.","doi":null,"url":"https://ijcai.org/proceedings/1983/131","pdf":"https://ijcai.org/proceedings/1983/0131.pdf","markdown":"https://ijcai.org/proceedings/1983/131.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/131","volume":{"slug":"1983","title":"Proceedings of the Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1983","url":"https://ijcai.org/proceedings/1983/","year":1983,"location":"Karlsruhe, West Germany","dates":"","editors":"Alan Bundy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Logic Programming","track":"Logic Programming","number":131,"pages":{"first":547,"last":548},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}