Computer Science – Logic in Computer Science
Scientific paper
2010-03-08
Computer Science
Logic in Computer Science
This paper is posted at the Computing Research Repository (CoRR) as part of the process of submission to the journal ACM Trans
Scientific paper
Term unification plays an important role in many areas of computer science, especially in those related to logic. The universal mechanism of grammar-based compression for terms, in particular the so-called Singleton Tree Grammars (STG), have recently drawn considerable attention. Using STGs, terms of exponential size and height can be represented in linear space. Furthermore, the term representation by directed acyclic graphs (dags) can be efficiently simulated. The present paper is the result of an investigation on term unification and matching when the terms given as input are represented using different compression mechanisms for terms such as dags and Singleton Tree Grammars. We describe a polynomial time algorithm for context matching with dags, when the number of different context variables is fixed for the problem. For the same problem, NP-completeness is obtained when the terms are represented using the more general formalism of Singleton Tree Grammars. For first-order unification and matching polynomial time algorithms are presented, each of them improving previous results for those problems.
Gascon Adrià
Godoy Guillem
Schmidt-Schauß Manfred
No associations
LandOfFree
Unification and Matching on Compressed Terms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Unification and Matching on Compressed Terms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unification and Matching on Compressed Terms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-677228