NP-completeness of the set unification and matching problems
The set-unification and set-matching problems, which are very restricted cases of the associative-commutative-idempotent unification and matching problems, respectively, are shown to be NP-complete. The NP-completeness of the subsumption check in first-order resolution follows from these results. It is also shown that commutative-idempotent matching and associative-idempotent matching are NP-hard, thus implying that the idempotency of a function does not help in reducing the complexity of matching and unification problems.
Unable to display preview. Download preview PDF.
- Benanav, D., Kapur, D., and Narendran, P., ”Complexity of Matching Problems,” Proc. of the First International Conf on Rewrite Techniques and Applications, Dijon, France, May 1985.Google Scholar
- Chang, C.-L., and Lee, R. C.-T., Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973.Google Scholar
- Garey, M.R., and Johnson, D.S., Computers and Intractability, W.H. Freeman, 1979.Google Scholar
- Kapur, D., and Narendran, P., ”An Equational Approach to Theorem Proving in First-Order Predicate Calculus,” Proc. of the Ninth International Joint Conf. on Artificial Intelligence, Los Angeles, August 1985.Google Scholar