Deciding the word problem in the union of equational theories sharing constructors

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

Volumn 1631, Issue , 1999, Pages 175-189

  Baader, Franz ^a   Tinelli, Cesare ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DECISION PROCEDURE; EQUATIONAL THEORY; WORD PROBLEM;

ALGEBRA;

EID: 84957659589     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48685-2_14     Document Type: Conference Paper

References (15)

1. F. Baader and K.U. Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. J. Symbolic Computation 21, 1996.
2. 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 Proc. CADE-14, Springer LNAI 1249, 1997.
3. F. Baader and C. Tinelli. Deciding the word problem in the union of equational theories. UIUCDCS-Report 98-2073, Department of Computer Science, University of Illinois at Urbana-Champaign, 1998. Available at http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.
4. A. Boudet. Combining unification algorithms. J. Symbolic Computation 16, 1993.
5. N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Communications of the ACM 22, 1979.
6. E. Domenjoud, F. Klay, and C. Ringeissen. Combination techniques for non-disjoint equational theories. In Proc. CADE-12, Springer LNAI 814, 1994.
7. H. Kirchner and Ch. Ringeissen. Combining symbolic constraint solvers on algebraic domains. J. Symbolic Computation 18, 1994.
8. T. Nipkow. Combining matching algorithms: The regular case. In Proc. RTA'89, Springer LNCS 335, 1989.
9. E. Ohlebusch. Modular properties of composable term rewriting systems. J. Symbolic Computation 20, 1995.
10. D. Pigozzi. The join of equational theories. Colloquium Mathematicum 30, 1974.
11. Ch. Ringeissen. Unification in a combination of equational theories with shared constants and its application to primal algebras. In Proc. LPAR'92, Springer LNAI 624, 1992.
12. Ch. Ringeissen. Combination of matching algorithms. In Proc. STACS-11, Springer LNCS 775, 1994.
13. M. Schmidt-Schauß. Combination of unification algorithms. J. Symbolic Computation 8, 1989.
14. E. Tidén. First-Order Unification in Combinations of Equational Theories. Phd thesis, The Royal Institute of Technology, Stockholm, 1986.
15. C. Tinelli and Ch. Ringeissen. 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, April 1998. (Also available as INRIA research report no. RR-3402.)