A Unification Algorithm for Infinite Trees

Mukai, Kuniaki

A Unification Algorithm for Infinite Trees

Download BibTeX Cite

Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Logic Programming. Pages 547-548.

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.

Kuniaki Mukai. 1983. A Unification Algorithm for Infinite Trees. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83. IJCAI, 547–548. https://ijcai.org/proceedings/1983/131

@inproceedings{ijcai1983p131,
  title     = {A Unification Algorithm for Infinite Trees},
  author    = {Mukai, Kuniaki},
  booktitle = {Proceedings of the Eighth International Joint Conference on
               Artificial Intelligence, {IJCAI-83}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Alan Bundy},
  pages     = {547--548},
  year      = {1983},
  note      = {Logic Programming},
  url       = {https://ijcai.org/proceedings/1983/131},
}

TY  - CPAPER
TI  - A Unification Algorithm for Infinite Trees
AU  - Mukai, Kuniaki
T2  - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1983
SP  - 547
EP  - 548
UR  - https://ijcai.org/proceedings/1983/131
ER  -