Abstract
In this paper, we present a parallel algorithm for term matching of logical terms on a mesh-connected array of processors. Term matching is a special case of unification in which one of the terms is fully ground, i.e. contains no variables. Term matching is a fundamental computational primitive in automated reasoning and has wide applicability to logic programming and symbolic pattern matching. Our algorithm runs inO(√N) time on a √N×√N two-dimensional mesh-connected array of processors.
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.
