A new combination procedure for the word problem that generalizes fusion decidability results in modal logics

From International Center for Computational Logic

Toggle side column

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
Information and Computation, 204(10):1413-1452, 2006
  • 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---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.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@article{ BaaGT-IC-06,
  author = {Franz {Baader} and Silvio {Ghilardi} and Cesare {Tinelli}},
  journal = {Information and Computation},
  number = {10},
  pages = {1413--1452},
  title = {A new combination procedure for the word problem that generalizes fusion decidability results in modal logics},
  volume = {204},
  year = {2006},
}