Complexity of nilpotent unification and matching problems

Information and Computation

Volumn 162, Issue 1-2, 2000, Pages 3-23

  Guo, Qing ^a   Narendran, Paliath ^a   Wolfram, D A ^b  

^a State University of New York   (United States)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR EQUATIONS; PATTERN MATCHING; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

MATCHING PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0034634023     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2849     Document Type: Article

References (27)

1. Aiken, A. (1994), Set constraints: results, applications and future directions, in "Proceedings of the Second Workshop on Principles and Practice of Constraints Programming," Lecture Notes in Computer Science, Vol. 874, pp. 326-335, Springer-Verlag, Berlin.
2. Aiken, A., Kozen, D., Vardi, M., and Wimmers, E. (1993), The complexity of set constraints, in "Proceedings of the 1993 Conference on Computer Science Logic," Lecture Notes in Computer Science, Vol. 832, pp. 1-17, Springer-Verlag, Berlin.
3. Baader, F. (1993), Unification in commutative theories, Hilbert's Basis Theorem, and Gröbner bases, J. Assoc. Comput. Mach. 40, 477-503.
4. Baader, F., and Schultz, K. U. (1992), Unification in the union of disjoint equational theories: combining decision procedures, in "Proceedings of the Eleventh Conference on Automated Deduction," Lecture Notes in Artificial Intelligence, Vol. 607, pp. 50-65, Springer-Verlag, Berlin.
5. Baader, F., and Siekmann, J. S. (1994), Unification theory, in "Handbook of Logic in Artificial Intelligence and Logic Programming" (D. M. Gabbay, C. J. Hogger, and J. A. Robinson, Eds.), pp. 41-125, Oxford University Press, Oxford.
6. Comon, H., Haberstrau, M., and Jouannaud, J.-P. (1992), Decidable problems in shallow equational theories, in "Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science," pp. 255-265, IEEE Computer Society, Washington, D.C.
7. Dershowitz, N., and Jouannaud, J.-P. (1990), Rewrite systems, in "Handbook of Theoretical Computer Science," pp. 245-320, Elsevier, Amsterdam.
8. Dershowitz, N., Mitra, S., and Sivakumar, G. (1992), Decidable matching for convergent systems, in "Proceedings of the Eleventh Conference on Automated Deduction," Lecture Notes in Artificial Intelligence, Vol. 607, pp. 589-602, Springer-Verlag, Berlin.
9. Garey, M. R., and Johnson, D. S. (1979), "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco.
10. Geddes, K. O., Czapor, S. R., and Labahn, G. (1992), "Algorithms for Computer Algebra," Kluwer Academic, Boston.
11. Goldfarb, W. D. (1981), The undecidability of the second-order unification problem, Theoret. Comput. Sci. 13, 225-230.
12. Heintze, N. (1994), Set-based analysis of ML programs, in "Proceedings of the 1994 ACM Conference on Lisp and Functional Programming," pp. 306-317.
13. Hermann, M., and Kolaitis, P. G. (1996), Unification algorithms cannot be combined in polynomial time, in "Proceedings of the Thirteenth Conference on Automated Deduction," Lecture Notes in Artificial Intelligence, Vol. 1104, pp. 246-260, Springer-Verlag, Berlin.
14. Hullot, J.-M. ( 1980), Canonical forms and unification, in "Proceedings of the Fifth Conference on Automated Deduction," Lecture Notes in Computer Science, Vol. 87, pp. 318-334, Springer-Verlag, Berlin.
15. Jouannaud, J.-P., and Kirchner, C. (1991), Solving equations in abstract algebras: a rule-based survey of unification, in "Computational Logic: Essays in Honor of Alan Robinson," pp. 360-394, MIT Press, Boston.
16. Kaltofen, E., Krishnamoorthy, M. S., and Saunders, B. D. (1987), Fast parallel computation of Hermite and Smith forms of polynomial matrices, SIAM J. Algebraic Discrete Methods 8, 683-690.
17. Kapur, D., and Narendran, P. (1986), NP-completeness of the set unification and matching problems, in "Proceedings of the Eighth Conference on Automated Deduction," Lecture Notes in Computer Science, Vol. 230, pp. 489-495, Springer-Verlag, Berlin.
18. Kapur, D., and Narendran, P. (1992), Complexity of unification problems with associative-commutative operators, J. Automated Reason. 9, 261-280.
19. Kirchner, C. (1986), Computing unification algorithms, in "Proceedings of the First Annual IEEE Symposium on Logic in Computer Science," pp. 206-216, IEEE Computer Society, Washington, D.C.
20. Martelli, A., and Montanari, U. (1982), An efficient unification algorithm, ACM Trans. Progr. Languages Systems 4, 258-282.
21. Narendran, P., Pfenning, F., and Statman, R. (1993), On the unification problem for cartesian closed categories, in "Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science," pp. 57-63, IEEE Computer Society, Washington, D.C.
22. (1997), J. Symbolic Logic 62(2), 636-647.
23. Nutt, W. (1990), Unification in monoidal theories, in "Proceedings of the 10th International Conference on Automated Deduction," Lecture Notes in Computer Science, Vol. 449, pp. 618-632, Springer-Verlag, Berlin.
24. Plotkin, G. D. (1972), Building-in equational theories, in "Machine Intelligence," Vol. 7, pp. 73-90, Edinburgh.
25. Schaefer, T. J. (1978), The complexity of satisfiability problems, in "Proceedings of the Tenth Annual ACM Symposium on Theory of Computing," pp. 216-226.
26. Schmidt-Schauss, M. (1995), "An Algorithm for Distributive Unification," Interner Bericht 13/94, Fachbereich Informatik, Universität Frankfurt, Frankfurt, Germany.
27. Wolfram, D. A. (1993), "The Clausal Theory of Types," Cambridge Univ. Press, Cambridge, UK.