Advertisement

NP-completeness of the set unification and matching problems

  • Deepak Kapur
  • Paliath Narendran
Unification Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 230)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [1]
    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
  2. [2]
    Chang, C.-L., and Lee, R. C.-T., Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973.Google Scholar
  3. [3]
    Garey, M.R., and Johnson, D.S., Computers and Intractability, W.H. Freeman, 1979.Google Scholar
  4. [4]
    Hsiang, J., ”Refutational Theorem Proving Using Term Rewriting Systems,” Artificial Intelligence 25 (3), pp. 255–300, March 1985.CrossRefGoogle Scholar
  5. [5]
    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
  6. [6]
    Paterson, M.S., and Wegman, M., ”Linear Unification,” Journal of Computer and System Sciences 16, pp. 158–167, 1978.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Deepak Kapur
    • 1
  • Paliath Narendran
    • 1
  1. 1.Corporate Research and Development General Electric CompanyComputer Science BranchSchenectady

Personalised recommendations