Tractable and intractable instances of combination problems for unification and disunification

Journal of Logic and Computation

Volumn 10, Issue 1, 2000, Pages 105-135

  Schulz, Klaus U ^a  

^a NONE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; OPTIMIZATION; POLYNOMIALS;

COMBINATION PROBLEMS; DETERMINISTIC COMBINATION ALGORITHMS; EQUATIONAL DISUNIFICATION; EQUATIONAL UNIFICATION; POLYNOMIAL COMBINATION ALGORITHMS;

PROBLEM SOLVING;

EID: 0033903826     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/10.1.105     Document Type: Article

References (39)

1. H. Ait-Kaci, A. Podelski and G. Smolka. A feature-based constraint system for logic programming with entailment. Theoretical Comuter Science, 122, 263-283, 1994.
2. A. Arnborg and E. Tidén. Unification problems with one-sided distributivity. In Proceedings of the 1st International Conference on Rewriting Techniques and Applications, J.-P. Jouannaud, ed., pp. 398-406. LNCS 202, Springer 1985.
3. F. Baader and K. U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. In Proceedings of the 11th Conference on Automated Deduction, pp. 50-65. LNAI 607, Springer, 1992.
4. F. Baader and K. U. Schulz. Combination techniques and decision problems for disunification. Theoretical Computer Science, 142, 229-255, 1995.
5. F. Baader and K. U. Schulz. On the combination of symbolic constraints, solution domains, and constraint solvers. In Principles and Practice of Constraint Programming - CP95, U. Montanari and F. Rossi, eds., pp. 380-398. LNCS 976, Springer, 1995.
6. F. Baader and K. U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. Journal of Symbolic Computation, 21, 211-243, 1996.
7. F. Baader and K. U. Schulz. Combination of constraint solvers for free and quasi-free structures, Theoretical Computer Science, 192, 107-161, 1998.
8. F. Baader and J. Siekmann, Unification Theory. In Handbook of Logic in Artificial Intelligence and Logic Programming, D. M. Gabbay, C. Hogger and J. Robinson, eds. pp. 41-125. Oxford University Press, Oxford, 1994.
9. F. Baader and C. Tinelli, A New Approach for Combining Decision Procedures for the Word Problem and Its Connection to the Nelson-Oppen Combination Method. In Proceedings of the 14th International Conference on Automated Deduction, W. McCune, ed., pp. 19-33. LNAI 1249, Springer, 1997.
10. A. Boudet. Combining Unification Algorithms. Journal of Symbolic Computation, 16, 597-626, 1993.
11. H. J. Bürckert, Solving Disequations in Equational Theories. Proceedings of the 9th International Conference on Automated Deduction, Argonne, LNCS 310, Springer, 1988.
12. A. Colmerauer. Equations and inequations on finite and infinite trees. In Proceedings of the 2nd International Conference on Fifth Generation Computer Systems, pp. 85-99, 1984.
13. A. Colmerauer. An introduction to PROLOG III. Communications of the ACM, 33, 69-90, 1990.
14. H. Comon. Disunification: a Survey. In Computational Logic, J.-L. Lassez, G. Plotkin, eds., MIT Press, 1991.
15. D. Cyrluk, P. Lincoln and N. Shankar, On Shostak's decision procedure for combinations of theories. In Proceedings of the 12th Conference on Automated Deduction, pp. 463-477. LNAI 814, Springer, 1994.
16. E. Domenjoud, F. Klay and R. Ringeissen. Combination techniques for non-disjoint equational theories. In Proceedings of the 12th Conference on Automated Deduction, pp. 267-281. LNAI 814, Springer, 1994.
17. M. R. Garey, D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco, 1979.
18. Q. Guo, P. Narendran and D. A. Wolfram, Unification and matching modulo nilpotence. In Proceedings of the 13th Conference on Automated Deduction, pp. 261-274. LNAI 1104, Springer, 1996.
19. M. Hermann and P. G. Kolaitis. Unification algorithms cannot be combined in polynomial time. In Proceedings of the 13th International Conference on Automated Deduction, M. A. McRobbie and J. K. Slaney, eds., pp. 246-260. LNAI 1104, Springer, 1996.
20. A. Herold. Combination of unification algorithms. In Proceedings of the 8th International Conference on Automated Deduction, LNCS 230, Springer, 1986.
21. D. Kapur and P. Narendran. Complexity of unification problems with associative-commutative operators. Journal of Automated Reasoning, 9, 261-288, 1992.
22. S. Kepser. Negation in combining constraint systems. In Frontiers of Combining Systems, Proceedings of the 2nd International Workshop, FroCoS'98, Amsterdam, D. M. Gabbay and M. de Rijke, eds., 1999, to appear.
23. S. Kepser and K. U. Schulz, Combination of constraint systems II: Rational amalgamation. In Principles and Practice of Constraint Programming - CP96, E. C. Freuder, ed., pp. 282-296. LNCS 1118, Springer, 1996. Extended version to appear in Theoretical Computer Science.
24. S. Kepser and J. Richts. Optimization techniques for combining constraint solvers. In Frontiers of Combining Systems, Proceedings of the 2nd International Workshop, FroCoS'98, Amsterdam, D. M. Gabbay and M. de Rijke, eds. 1999, to appear.
25. C. Kirchner. Méthodes et outils de conception systématique d'algorithms d'unification dans les théories équationelles, Thèse d'Etat, Université de Nancy 1, France, 1985.
26. D. S. Lankford, G. Butler and B. Brady. Abelian group unification algorithms for elementary terms. Contemporary Mathematics, 29, 1984.
27. M. J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proceedings of Third Annual Symposium on Logic in Computer Science, LICS'88, Edinburgh, Scotland, pp. 348-357, IEEE Computer Society, 1988.
28. C. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Trans. Programming Languages and Systems, 2, 245-257, 1979.
29. T. Nipkow. Combining matching algorithms: the regular case. In Proceedings of the 3rd International Conference on Rewriting Techniques and Applications, N. Dershowitz, ed., pp. 343-358. LNCS 335, Springer, 1989.
30. D. C. Oppen. Complexity, convexity and combination of theories. Theoretical Computer Science, 12, 291-302, 1980.
31. D. Pigozzi. The join of equational theories, Colloquium Mathematicum, XXX, 15-25, 1974.
32. C. Ringeissen. Cooperation of decision procedures for the satisfiability problem. In Frontiers of Combining Systems, Proceedings of the 1st International Workshop, FroCoS'96, Munich, Germany, F. Baader and K. U. Schulz, eds., pp. 121-141. Applied Logic Series 3, Kluwer, 1996.
33. M. Schmidt-Schauß. Combination of unification algorithms, Journal of Symbolic Computation, 8, 51-99, 1989.
34. K. U. Schulz. A criterion for intractability of E-unification with free function symbols and its relevance for combination of unification algorithms. In Rewriting Techniques and Applications, 8th International Conference (RTA-97), H. Comon, ed., pp. 284-298. LNCS 1232, Springe, 1997.
35. R. E. Shostak. Deciding combinations of theories. Journal of the ACM, 31, 1-12, 1984.
36. G. Smolka, R. Treinen. Records for logic programming. Journal of Logic Programming, 18, 229-258, 1994.
37. E. Tidén. Unification in combinations of collapse free theories with disjoint sets of function symbols. In Proceedings of the 8th International Conference on Automated Deduction, J. H. Siekmann, ed., pp. 431-449. LNCS 230, Springer, 1986.
38. C. Tinelli and M. Harand. A new correctness proof of the Nelson-Oppen combination procedure. In Frontiers of Combining Systems, Proceedings of the 1st International Workshop, FroCoS'96, Munich, Germany, F. Baader and K. U. Schulz, eds., pp. 103-121. Applied Logic Series 3, Kluwer, 1996.
39. K. Yelick. Unification in combinations of collapse free regular theories. Journal of Symbolic Computation, 3, 153-182, 1987.