Skip to main content
Conference Proceedings

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) (2000) 1794 260-274
DOI: 10.1007/10720084_17
5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we extend the applicability of our combination method for decision procedures for the word problem to theories sharing non-collapse-free constructors. This extension broadens the scope of the combination procedure considerably, for example in the direction of equational theories axiomatizing the equivalence of modal formulae.

Cite

CITATION STYLE

APA

Baader, F., & Tinelli, C. (2000). Combining equational theories sharing non-collapse-free constructors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1794, pp. 260–274). Springer Verlag. https://doi.org/10.1007/10720084_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free