A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics
From International Center for Computational Logic
A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics
Franz BaaderFranz Baader, Silvio GhilardiSilvio Ghilardi, Cesare TinelliCesare Tinelli
Franz Baader, Silvio Ghilardi, Cesare Tinelli
A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics
Technical Report, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, volume LTCS-03-05, 2003. LTCS-Report
A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics
Technical Report, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, volume LTCS-03-05, 2003. LTCS-Report
- KurzfassungAbstract
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---whose combination is not disjoint since they share 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 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. - Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
- Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@techreport{ BaGiTiLTCS-03-05,
address = {Germany},
author = {F. {Baader} and Silvio {Ghilardi} and Cesare {Tinelli}},
institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
number = {LTCS-03-05},
title = {A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics},
type = {LTCS-Report},
year = {2003},
}