Proceedings

A Unification Algorithm for Infinite Trees

Download BibTeX Cite

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

© 1983 International Joint Conferences on Artificial Intelligence

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.

  1. Martelli, A., and Montanari, U. An Efficient Unification Algorithm. ACM Trans. on Program- ming Lang. and Syst., Vol.4, No.2, April 1982.
  2. Colmerauer, A. Prolog and Infinite Trees . Logic Programming, Academic Press, 1982.
  3. Warren, D.H . D: Implementing Prolog -Compil- ing Predicate Logic Programs, Dept. of AI , Univ. of Edinb urgh Research Report 39&40 , 1977.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards