Unification modulo ACI + 1 + 0

Fundamenta Informaticae

Volumn 25, Issue 1, 1996, Pages 49-57

  Narendran, Paliath ^a  

^a State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26444478667     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1996-25105     Document Type: Article

References (18)

1. F. Baader and K.U. Schultz. Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures. Proceedings of the 11th Conference on Automated Deduction (CADE-11), Saratoga Springs, NY, LNAI 607, Springer Verlag, 1992, 50-65.
2. F. Baader and K.U. Schultz. Combination Techniques and Decision Problems for Disunification. Proceedings of the 5th International Conference, RTA-93, LNCS 690, Springer Verlag, 1993, 301-315.
3. F. Baader and J.S. Siekmann. Unification theory. in: D.M. Gabbay, C.J. Hogger, J.A. Robinson (ed.), Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, 1994.
4. D. Benanav, D. Kapur, and P. Narendran. Complexity of Matching Problems. Journal of Symbolic Computation 3 (1987) 203-216.
5. H.-J. Bürckert, A. Herold, and M. Schmidt-Schauss. On Equational Theories, Unification, and (Un)Decidability. Journal of Symbolic Computation 8 (1989) 3-49.
6. H. Comon. Disunification: A Survey. In: Computational Logic: Essays in Honor of Alan Robinson, (Lassez and Plotkin, eds.), MIT Press, 1991, 322-359.
7. N. Dershowitz, and J.P. Jouannaud. Rewrite Systems, in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics (Elsevier, Amsterdam, 1990) 243-320.
8. W.F. Dowling, and J. Gallier. Linear-time algorithms for Testing the Satisfiability of Prepositional Horn Formulae. Journal of Logic Programming 3 (1984) 267-284.
9. F. Fages. Associative-Commutative Unification. Journal of Symbolic Computation 3 (1987) 257-275.
10. M.R. Garey, and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, San Francisco, 1979.
11. J.-P. Jouannaud, and C. Kirchner. Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification. In: Computational Logic: Essays in Honor of Alan Robinson, (Lassez and Plotkin, eds.), MIT Press, 1991, 360-394.
12. D. Kapur, and P. Narendran. NP-completeness of the Set-Unification and Matching Problems. Presented at the 8th International Conference on Automated Deduction (CADE-8), Oxford, England, July 1986.
13. D. Kapur, and P. Narendran. Complexity of Unification Problems with Associative-Commutative Operators. J. Automated Reasoning, 9 (2) 261-288.
14. D. Kapur, and P. Narendran. Double-Exponential Complexity of Computing a Complete Set of AC-Unifiers. In: Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS), Santa Cruz, CA, 1992, 11-21.
15. T.J. Schaefer. The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978.
16. M. Schmidt-Schauss. Unification in a combination of arbitrary disjoint equational theories. Journal of Symbolic Computation 8 (1989) 51-99.
17. J.H. Siekmann. Unification Theory. Journal of Symbolic Computation 7 (1989) 207-274.
18. M.E. Stickel. A Unification Algorithm for Associative-Commutative Functions. Journal of the ACM 28 (1981) 423-434.