- Titel
- A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-790570
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 03-05
- Erstveröffentlichung
- 2003
- DOI
- https://doi.org/10.25368/2022.130
- Abstract (EN)
- 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.
- This report has also appeared as Report No. 03-03, Department of Computer Science, The University of Iowa.
- Freie Schlagwörter (DE)
- Boolesche Algebra, Modallogik, Beschreibungslogik, Entscheidbarkeit
- Freie Schlagwörter (EN)
- boolean algebra, modal logic, description logic, decidability
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Publizierende Institution
- Technische Universität Dresden, Dresden
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-790570
- Veröffentlichungsdatum Qucosa
- 30.05.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0