Why combined decision problems are often intractable?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1794, Issue , 2001, Pages 217-244

  Schulz, Klaus U ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

AUTOMATED DEDUCTION; COMBINATION METHOD; DECISION PROCEDURE; DISJUNCTIVE NORMAL FORM; EQUATIONAL THEORY; EXPONENTIAL NUMBERS; FIRST ORDER THEORIES; UNIFICATION PROBLEM;

OPTIMIZATION;

EID: 84949186692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10720084_15     Document Type: Conference Paper

References (31)

1. F. Baader, “On the Complexity of Boolean Unification,” Information Processing Letters 67 (4), 1998, pp. 215-220.
2. F. Baader, K.U. Schulz, “Combination techniques and decision problems for disunification,” Theoretical Computer Science 142 (1995), pp. 229-255.
3. F. Baader, K.U. Schulz, “Unification in the union of disjoint equational theories: Combining decision procedures,” Journal of Symbolic Computation 21 (1996), pp. 211-243.
4. F. Baader, J. Siekmann, “Unification Theory,” in D.M. Gabbay, C. Hogger, and J. Robinson, Editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, Oxford, UK, 1994, pp. 41-125.
5. A. Boudet, “Combining Unification Algorithms,” Journal of Symbolic Computation 16, (1993), pp. 597-626.
6. D. Cyrluk, P. Lincoln, N. Shankar, “On Shostak’s decision procedure for combinations of theories,” in: Proceedings of the 12th Conference on Automated Deduction, Springer LNAI 814, 1994, pp. 463-477.
7. E. Domenjoud, F. Klay, R. Ringeissen, “Combination Techniques for Non-Disjoint Equational Theories,” in: Proceedings of the 12th Conference on Automated Deduction, Springer LNAI 814, 1994, pp. 267-281.
8. P. Downey, R. Sethi, “Assignment commands with array references,” Journal of the ACM 25 (4), 1994, pp. 652-666.
9. 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).
10. Q. Guo, P. Narendran, and D.A. Wolfram, “Unification and Matching modulo Nilpotence,” in: Proceedings of the 13th Conference on Automated Deduction, Springer LNAI 1104, 1996, pp. 261-274.
11. M. Hermann, 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.), Springer LNAI 1104, 1996, pp. 246-260.
12. A. Herold, “Combination of Unification Algorithms,” Proceedings of the 8th International Conference on Automated Deduction, Springer LNCS 230, 1986.
13. D. Kapur, P. Narendran, “Complexity of Unification Problems with Associative-Commutative Operators,” J. Automated Reasoning 9, 1992, pp. 261-288.
14. S. Kepser, “Negation in Combining Constraint Systems,” in: Frontiers of Combining Systems 2, Papers presented at FroCoS’98, D.M Gabbay, M. de Rijke (Eds.), Research Studies Press/Wiley, Amsterdam 2000, pp. 117-192.
15. S. Kepser, J. Richts, “Optimization Techniques for Combining Constraint Solvers,” in: Frontiers of Combining Systems 2, Papers presented at FroCoS’98, D.M Gabbay, M. de Rijke (Eds.), Research Studies Press/Wiley, Amsterdam 2000, pp. 193-210.
16. C. Kirchner, “Methodes et outils de conception systematique d’algorithms d‘unification dans les theories equationelles,” These d’Etat, Universite de Nancy 1, France, 1985.
17. D.S. Lankford, G. Butler, and B. Brady, “Abelian Group Unification Algorithms for Elementary Terms,” Contemporary Mathematics 29, 1984.
18. C.G. Nelson, D.C. Oppen, “Simplification by cooperating decision procedures,” ACM Trans. Programming Languages and Systems 2 (1), 1979, pp. 245-257.
19. C.G. Nelson, D.C. Oppen, “Fast decision algorithms based on congruence closure,” Journal of the ACM 27 (2), 1980, pp. 356-364.
20. T. Nipkow, “Combining Matching Algorithms: The Regular Case,” in: Proceedings of the 3rd International Conference on Rewriting Techniques and, Applications, N. Dershowitz (Ed.), Springer LNCS 335, 1989, pp. 343-358.
21. D.C. Oppen, “Complexity, Convexity and Combination of Theories,” Theoretical Computer Science 12, 1980, pp. 291-302.
22. D. Pigozzi, “The Join of Equational Theories,” Colloquium Mathematicum Vol. XXX (1974) pp. 15-25.
23. 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, K.U. Schulz (Eds.), Applied Logic Series 3, Kluwer, 1996, pp. 121-141.
24. T. J. Schaefer, “The complexity of satisfiability problems,” in: Proceedings 10th Symposium on Theory of Computing, San Diego, CA, 1978, pp. 216-226.
25. M. Schmidt-Schaufi, “Combination of Unification Algorithms,” J. Symbolic Computation 8, 1989, pp. 51-99.
26. K.U. Schulz, “A Criterion for Intractability of E-unification with Free Function Symbols and its Relevance for Combination of Unification Algorithms,” in: Proceedings of the 8th International Conference on Rewriting Techniques and Applications, H. Comon (Ed.), Springer LNCS 1232, 1997, pp. 284-298.
27. K.U. Schulz, “Tractable and Intractable Instances of Combination Problems for Unification and Disunification,” to appear in Journal of Logic and Computation, Volume 10 (1), 2000.
28. R.E. Shostak, “Deciding Combinations of Theories,” Journal of the ACM 31(1), 1984, pp. 1-12.
29. E. Tiden, “Unification in Combinations of Collapse Free Theories with Disjoint Sets of Function Symbols,” In: J.H. Siekmann (Ed.), Proceedings of the 8th International Conference on Automated Deduction, LNCS 230, 1986, pp. 431-449.
30. C. Tinelli, M. Harandi, “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, K.U. Schulz (Eds.), Applied Logic Series 3, Kluwer, 1996, pp. 103-121.
31. K. Yelick, “Unification in Combinations of Collapse Free Regular Theories,” J. Symbolic Computation 3, 1987.