Yet Another Efficient Unification Algorithm
Alin Suciu

TL;DR
This paper introduces a new efficient unification algorithm based on a specialized data structure called the Unification Table, aiming to improve the core process in logic programming.
Contribution
It presents a novel unification algorithm utilizing the Unification Table, offering potential efficiency improvements over existing methods.
Findings
Demonstrates improved efficiency in unification process
Introduces the Unification Table data structure
Provides theoretical analysis of algorithm performance
Abstract
The unification algorithm is at the core of the logic programming paradigm, the first unification algorithm being developed by Robinson [5]. More efficient algorithms were developed later [3] and I introduce here yet another efficient unification algorithm centered on a specific data structure, called the Unification Table.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Formal Methods in Verification · Parallel Computing and Optimization Techniques
