Combining equational theories sharing non-collapse-free constructors

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

Volumn 1794, Issue , 2000, Pages 260-274

  Baader, Franz ^a   Tinelli, Cesare ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

AXIOMATIZING; COMBINATION METHOD; COMBINATION PROCEDURE; DECISION PROCEDURE; EQUATIONAL THEORY; WORD PROBLEM;

ARTIFICIAL INTELLIGENCE;

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

References (14)

1. F. Baader and P. Narendran. Unification of concept terms in description logics. In H. Prade, editor, Proc. of ECAI-98, pages 331-335. John Wiley & Sons Ltd, 1998.
2. F. Baader and K. U. Schulz. Combination of constraint solvers for free and quasi- free structures. Theoretical Computer Science, 192:107-161, 1998.
3. F. Baader and C. Tinelli. Combining equational theories sharing non-collapse-free constructors. TR 99-13, Dept. of Computer Science, University of Iowa, 1999.
4. F. Baader and C. Tinelli. Deciding the word problem in the union of equational theories sharing constructors. In P. Narendran and M. Rusinowitch, editors, Proc. of RTA'99, volume 1631 of LNCS, pages 175-189. Springer-Verlag, 1999. Longer version available as TR UIUCDCS-R-98-2073, Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1998.
5. E. Domenjoud, F. Klay, and Ch. Ringeissen. Combination techniques for nondisjoint equational theories. In A. Bundy, editor, Proc. of CADE-12, volume 814 of LNAI, pages 267-281. Springer-Verlag, 1994.
6. E. Hemaspaandra. Complexity transfer for modal logic (extended abstract). In Proc, of LICS'94, pages 164-173, 1994. IEEE Computer Society Press.
7. S. Koppelberg. General theory of Boolean algebras. In J. Monk, editor, Handbook of Boolean Algebras. North-Holland, Amsterdam, The Netherlands, 1988.
8. M. Kracht and F. Wolter. Simulation and transfer results in modal logic: A survey. Studia Logica, 59:149-177, 1997.
9. M. Kracht. Tools and Techniques in Modal Logic. Elsevier, Amsterdam, The Netherlands, 1999.
10. E. J. Lemmon. Algebraic semantics for modal logics. J. of Symbolic Logic, 31(1):46-65, 1966.
11. T. Nipkow. Combining matching algorithms: The regular case. In N. Dershowitz, editor, Proc. of RTA'89, volume 335 of LNCS, pages 343-358. Springer-Verlag, 1989.
12. Don Pigozzi. The join of equational theories. Colloquium Mathematicum, 30(1):15-25, 1974.
13. Manfred Schmidt-Schauß. Combination of unification algorithms. J. of Symbolic Computation, 8(1-2):51-100, 1989.
14. C. Tinelli and Ch. Ringeissen. Non-disjoint unions of theories and combinations of satisfiability procedures: First results. TR UIUCDCS-R-98-2044, Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1998.