Yet Another Efficient Unification Algorithm

The unification algorithm is at the heart of the logic program ming paradigm [3]. Starting with the classic algorithm of Robinson [5], the unification algor ithm was developed to become more and more efficient [4]. Even nowadays the unification theory is sti ll under development and is receiving continuous scrutiny from the scientific community [2]. The present paper presents yet another efficient unification a lgorithm centered on a data structure called Unification Table, which borrows some ideas from the data structures used by the Warren's Abstract Machine [1]. The next paragraph presents in detail the proposed unificati on algorithm, giving the C-style pseudo code. An example of application of the algorithm take n from [1] is also presented.