Complexity of matching problems
Proc. of the first international conference on Rewriting techniques and applications
Handbook of logic in artificial intelligence and logic programming
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Solvability of context equations with two context variable is decidable
Journal of Symbolic Computation
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Complexity of Language Recognition Problems for Compressed Words
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Pattern Matching and Membership for Hierarchical Message Sequence Charts
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On the Exponent of Periodicity of Minimal Solutions of Context Equation
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Testing Equivalence of Morphisms on Context-Free Languages
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
A uniform approach to underspecification and parallelism
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Word Problems and Membership Problems on Compressed Words
SIAM Journal on Computing
Conjunctive queries over trees
Journal of the ACM (JACM)
Efficient memory representation of XML document trees
Information Systems
Context Matching for Compressed Terms
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
The Complexity of Monadic Second-Order Unification
SIAM Journal on Computing
XML Tree Structure Compression
DEXA '08 Proceedings of the 2008 19th International Conference on Database and Expert Systems Application
Parameter Reduction in Grammar-Compressed Trees
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Unification with Singleton Tree Grammars
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Context unification with one context variable
Journal of Symbolic Computation
Computing procedure summaries for interprocedural analysis
ESOP'07 Proceedings of the 16th European conference on Programming
Efficient memory representation of XML documents
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Faster algorithm for bisimulation equivalence of normed context-free processes
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Stratified context unification is NP-complete
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Bounded second-order unification is NP-complete
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Processing compressed texts: a tractability border
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Congruence closure of compressed terms in polynomial time
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Parameter reduction and automata evaluation for grammar-compressed trees
Journal of Computer and System Sciences
New algorithms for unification modulo one-sided distributivity and its variants
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
XML tree structure compression using RePair
Information Systems
| Hi-index | 0.00 |
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 (STGAs), 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 article 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.