A criterion for intractability of E-unification with free function symbols and its relevance for combination of unification algorithms

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

Volumn 1232, Issue , 1997, Pages 284-298

  Schulz, Klaus U ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

E-UNIFICATION PROBLEMS; EQUATIONAL THEORY; EQUATIONAL UNIFICATION; FUNCTION SYMBOLS; POLYNOMIAL ALGORITHM; POLYNOMIAL OPTIMIZATION; UNIFICATION ALGORITHMS; UNIFICATION PROBLEM;

ARTIFICIAL INTELLIGENCE;

EID: 84947799608     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62950-5_78     Document Type: Conference Paper

References (21)

1. F. Baader, K.U. Schulz, "Unification in the union of disjoint equational theories: Combining decision procedures," in: Proc. CADE-11, LNAI 607, 1992, pp. 50-65.
2. 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.
3. 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.
4. L. Bachmair, Canonical equational proofs, Progress in Theoretical Computer Science, Birkhäuser, Boston, 1991.
5. A. Boudet, "Combining Unification Algorithms," Journal of Symbolic Computation 16 (1993) pp. 597-626.
6. 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).
7. Q. Guo, P. Narendran, and D.A. Wolfram "Unification and Matching modulo Nilpotence," manuscript, received from Qing Guo, guo@cs.albany.edu, 1996.
8. 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.
9. A. Herold, "Combination of Unification Algorithms," Proceedings of the 8th International Conference on Automated Deduction, LNCS 230, 1986, pp. 450-469.
10. J.P. Jouannaud, H. Kirchner, "Completion of a set of rules modulo a set of equations," SIAM J. Computing 15, 1986, pp. 1155-1194.
11. D. Kapur, P. Narendran, "Complexity of Unification Problems with Associative-Commutative Operators," J. Automated Reasoning 9, 1992, pp. 261-288.
12. S. Kepser, J. Richts, "Optimization Techniques for the Combination of Unification Algorithms," to be submitted.
13. C. Kirchner, "Méthodes et outils de conception systématique d'algorithmes d'unification dans les theories équationelles," These d'Etat, Université de Nancy 1, France, 1985.
14. R. Niewenhuis, A. Rubio, "AC-superposition with constraints: No AC- unifiers needed," in Proceedings of the 12th International Conference on Automated Deduction, Nancy, France, A. Bundy (Ed.), Springer LNAI 1994, pp.545-559.
15. G. Plotkin, "Building in equational theories," Machine Intelligence 7, 1972, pp. 73-90.
16. A. Rubio, "Theorem Proving modulo Associativity," in Proceedings Computer Science Logic CSL'95, Paderborn, Germany, H. Kleine Büning (Ed.), Springer LNCS 1092 (1995), pp. 452-467.
17. M. Schmidt-Schauß, "Combination of Unification Algorithms," J. Symbolic Computation 8, 1989, pp. 51-99.
18. K.U. Schulz, "Combination of Unification and Disunification Algorithms: Tractable and Intractable Instances," Research Paper, available under ftp.cis.uni-muenchen.de, in directory pub / schulz. Filename: ComplexityCom- bination.ps.gz
19. M. Stickel, "Automated deduction by theory resolution," J. Automated Reasoning 1, 1985, pp. 333-356.
20. E. Tid'en, "Unification in Combinations of Collapse Free Theories with Disjoint Sets of Function Symbols," Proceedings of the 8th International Conference on Automated Deduction, LNCS 230, 1986.
21. K. Yelick, "Unification in Combinations of Collapse Free Regular Theories," J. Symbolic Computation 3, 1987.