Complexity of matching problems
Proc. of the first international conference on Rewriting techniques and applications
Parallel algorithms for term matching
Proc. of the 8th international conference on Automated deduction
NP-completeness of the set unification and matching problems
Proc. of the 8th international conference on Automated deduction
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Journal of the ACM (JACM)
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
A Unification Algorithm for Associative-Commutative Functions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
RRL: A Rewrite Rule Laboratory
Proceedings of the 8th International Conference on Automated Deduction
On equations including string variables
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Associative commutative pattern matching
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Journal of Automated Reasoning
Computational Complexity of Simultaneous Elementary Matching Problems
Journal of Automated Reasoning
Single Elementary Associative-Commutative Matching
Journal of Automated Reasoning
ELAN from a rewriting logic point of view
Theoretical Computer Science - Rewriting logic and its applications
On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Handbook of automated reasoning
Simultaneous Rigid E-Unification and Related Algorithmic Problems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Journal of Functional Programming
A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Experiments with associative-commutative discrimination nets
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Anti-patterns for rule-based languages
Journal of Symbolic Computation
Associative-commutative rewriting on large terms
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
On the implementation of construction functions for non-free concrete data types
ESOP'07 Proceedings of the 16th European conference on Programming
Compilation techniques for associative-commutative normalisation
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
UNIFICATION MODULO ACI + 1 + 0
Fundamenta Informaticae
| Hi-index | 0.00 |
The associative-commutative matching problem is shown to be NP-complete; more precisely, the matching problem for terms in which some function symbols are uninterpreted and others are both associative and commutative, is NP-complete. It turns out that the similar problems of associative-matching and commutative-matching are also NP-complete. However, if every variable appears at most once in a term being matched, then the associative-commutative matching problem is shown to have an upper-bound of O ( | s | ^* | t |^3), where | s | and | t | are respectively the sizes of the pattern 8 and the subject t.