We show that the associative-commutative matching problem is 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 s and the subject t.
CITATION STYLE
Benanav, D., Kapur, D., & Narendran, P. (1985). Complexity of matching problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 202 LNCS, pp. 417–429). Springer Verlag. https://doi.org/10.1007/3-540-15976-2_22
Mendeley helps you to discover research relevant for your work.