A unification algorithm for infinite trees

  • Authors:

  • Kuniaki Mukai

  • Affiliations:

  • Institute for New Generation Computer Technology, Tokyo, Japan

  • Venue:
  • IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
  • Year:
  • 1983

Quantified Score

Hi-index 0.00

Visualization

Abstract

A simple unification algorithm for infinite trees has been developed. The algorithm is designed to work efficiently under structure sharing implementations of logic programming languages, e.g., Prolog (Warren [3]). A relation, called "is covered with", between two terms is introduced to terminate the algorithm. The fundamental operations are to compute the frontier set of two given terms and to test the relation between them. A termination proof is shown.