Abstract
Abstract This paper presents the design of a special‐purpose cellular tree architecture for the unification algorithm. The unification algorithm either finds the most general substitution which makes a set of terms identical, or else returns failure. The resulting substitution is permitted to contain loops. Many of the more recent pure logic programs make use of such recursive substitutions to store data structures which are accessed in a lazy fashion. So lack of such an occurs check is intentional. The algorithm involves only integer comparison and shifting operations between adjacent cells in a data‐driven computation mode. The physical design of a VLSI chip, therefore, should be quite easy. Each unification problem runs on the cellular tree in worst‐case time O (n · logn), where n is the number of input symbols. Many unification problems can be run simultaneously on the same chip with no slowdown.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
