Journal article
A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
Information and computation, Vol.204(10), pp.1413-1452
2006
DOI: 10.1016/j.ic.2005.05.009
Abstract
Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics—which are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other types of equational theories. In this paper, we present a new approach for combining decision procedures for the word problem in the non-disjoint case that applies to equational theories induced by modal logics, but is not restricted to them. The known fusion decidability results for modal logics are instances of our approach. However, even for equational theories induced by modal logics our results are more general since they are not restricted to so-called normal modal logics.
Details
- Title: Subtitle
- A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
- Creators
- Franz Baader - Technische Universität DresdenSilvio Ghilardi - University of MilanCesare Tinelli - University of Iowa
- Resource Type
- Journal article
- Publication Details
- Information and computation, Vol.204(10), pp.1413-1452
- DOI
- 10.1016/j.ic.2005.05.009
- ISSN
- 0890-5401
- eISSN
- 1090-2651
- Publisher
- Elsevier Inc
- Language
- English
- Date published
- 2006
- Academic Unit
- Computer Science
- Record Identifier
- 9984259423102771
Metrics
18 Record Views