Deciding the word problem in the union of equational theories

Information and Computation

Volumn 178, Issue 2, 2002, Pages 346-390

  Baader, Franz ^a   Tinelli, Cesare ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b University of Iowa   (United States)

Author keywords

Combination of decision procedures; Equational reasoning; Word problem

Indexed keywords

PROBLEM SOLVING; SET THEORY; SYSTEM THEORY; THEOREM PROVING;

EQUATIONAL THEORIES; WORD PROBLEM;

DECISION THEORY;

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

References (29)

1. Baader, F., and Nipkow, T. (1998), "Term Rewriting and All That," Cambridge Univ. Press, Cambridge, UK.
2. Baader, F., and Schulz, K. U. (1998), Combination of constraint solvers for free and quasi-free structures, Theoret. Comput. Sci. 192, 107-161.
3. Baader, F., and Tinelli, C. (1997), 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, Townsville, Australia" (W. McCune, Ed.) Lecture Notes in Artificial Intelligence, Vol. 1249, pp. 19-33, Springer-Verlag, Berlin.
4. Baader, F., and Tinelli, C. (1998), "Deciding the Word Problem in the Union of Equational Theories," Technical Report UIUCDCS-R-98-2073, Department of Computer Science, University of Illinois at Urbana-Champaign.
5. Baader, F., and Tinelli, C. (1999), "Combining Equational Theories Sharing Non-Collapse-Free Constructors," Technical Report 99-13, Department of Computer Science, University of Iowa.
6. Baader, F., and Tinelli, C. (1999), Deciding the word problem in the union of equational theories sharing constructors, in "Proceedings of the 10th International Conference on Rewriting Techniques and Applications. Trento, Italy" (P. Narendran and M. Rusinowitch, Eds.) Lecture Notes in Computer Science, Vol. 1631, pp. 175-189, Springer-Verlag, Berlin.
7. Baader, F., and Tinelli, C. (2000), Combining equational theories sharing non-collapse-free constructors, in "Proceedings of the 3rd International Workshop on Frontiers of Combining Systems, FroCoS'2000, Nancy, France" (H. Kirchner and Ch. Ringeissen, Eds.) Lecture Notes in Artificial Intelligence, Vol. 1794, pp. 260-274, Springer-Verlag, Berlin.
8. Dershowitz, N., and Manna, Z. (1979), Proving termination with multiset orderings, Commun. Assoc. Comput. Mach. 22, 465-476.
9. Domenjoud, E., Klay, F., and Ringeissen, C. (1994), Combination techniques for non-disjoint equational theories, in "Proceedings of the 12th International Conference on Automated Deduction, Nancy, France" (A. Bundy, Ed.), Lecture Notes in Artificial Intelligence, Vol. 814, pp. 267-281, Springer-Verlag, Berlin.
10. Fiorentini, C., and Ghilardi, S. (2001), "Path Rewriting and Combined Word Problems," Technical Report 250-00, Department of Computer Science, Università degli Studi di Milano, Milan, Italy. Revised version Theoret. Comput. Sci., to appear.
11. Hodges, W. (1993), Model theory, in "Encyclopedia of Mathematics and Its Applications," Cambridge Univ. Press, Cambridge, UK.
12. Jouannaud, J.-P., and Kirchner, H. (1986), Completion of a set of rules modulo a set of equations, SIAM J. Comput. 15, 1155-1194.
13. Kirchner, H., and Ringeissen, C. (1994), Combining symbolic constraint solvers on algebraic domains, J. Symbolic Comput. 18, 113-155.
14. Knuth, D. E., and Bendix, P. B. (1970), Simple word problems in universal algebra, in "Computational Problems in Abstract Algebra" (J. Leech, Ed.), pp. 263-297, Pergamon, Elmsford, NY.
15. Martelli, A., and Montanari, U. (1982), An efficient unification algorithm, ACM Trans. Programming Languages System 4, 258-282.
16. Matijasevic, J. V. (1967), Simple examples of undecidable associative calculi, Soviet Math. (Dokl.) 8, 555-557.
17. Nelson, G., and Oppen, D. C. (1979), Simplification by cooperating decision procedures, ACM Trans. Programming Languages System 1, 245-257.
18. Nelson, G., and Oppen, D. C. (1980), Fast decision procedures based on congruence closure, J. Assoc. Comput. Mach. 27, 356-364.
19. Nipkow, T. (1989), Combining matching algorithms: The regular case, in "Proceedings of the 3rd International Conference on Rewriting Techniques and Applications, Chapel Hill, NC" (N. Dershowitz, Ed.), Lecture Notes in Computer Science, Vol. 335, pp. 343-358, Springer-Verlag, Berlin.
20. Ohlebusch, E. (1995), Modular properties of composable term rewriting systems, J. Symbolic Comput. 20, 1-41.
21. Pigozzi, D. (1974), The join of equational theories, Colloq. Math. 30, 15-25.
22. Robinson, J. A. (1965), A machine-oriented logic based on the resolution principle, J. Assoc. Comput. Mach. 12, 23-41.
23. Schmidt-Schauß, M. (1989), Unification in a combination of arbitrary disjoint equational theories, J. Symbolic Comput. 8, 51-100 Special issue on unification. Part II.
24. Tidén, E. (1986), "First-Order Unification in Combinations of Equational Theories," Ph.D. dissertation, The Royal Institute of Technology, Stockholm.
25. Tinelli, C., and Harandi, M. T. (1996), A new correctness proof of the Nelson-Oppen combination procedure, in "Frontiers of Combining Systems: Proceedings of the 1st International Workshop, Applied Logic, Munich, Germany" (F. Baader and K.U. Schulz, Eds.), pp. 103-120, Kluer Academic, Dordrecht.
26. Tinelli, C., and Ringeissen, C. (1998) "Non-Disjoint Unions of Theories and Combinations of Satisfiability Procedures: First Results," Technical Report UIUCDCS-R-98-2044, Department of Computer Science, University of Illinois at Urbana-Champaign. Also available as INRIA Research Report RR-3402.
27. Tinelli, C., and Ringeissen, C. (2002), Unions of non-disjoint theories and combinations of satisfiability procedures, Theoret. Comput. Sci., to appear.
28. Toyama, Y. (1987), Counterexamples to termination for the direct sum of term rewriting systems, Inform. Process. Lett. 25, 141-143.
29. Toyama, Y. (1987), On the Church-Rosser property for the direct sum of term rewriting systems, J. Assoc. Comput. Mach. 34, 128-143.