Journal of Logic and Computation · 2018 · 15 citations · 12 references
ComputingComputer ScienceMathematicsAlgorithmsLogicTheory Of ComputationPredicate LogicPropositional LogicBoolean SatisfiabilitySatisfiabilitySatisfiability ProblemUnsatisfiability
Relation-changing modal logics (RC for short) are extensions of the basic modal logic with dynamic operators that modify the accessibility relation of a model during the evaluation of a formula. These languages are equipped with dynamic modalities that are able e.g. to delete, add and swap edges in the model, both locally and globally. We study the satisfiability problem for some of these logics. We first show that they can be translated into hybrid logic. As a result, we can transfer some results from hybrid logics to RC. We discuss in particular decidability for some fragments. We then show that satisfiability is, in general, undecidable for all the languages introduced, via translations from memory logics.
12
Patrick Blackburn · Journal of Logic Language and Information · 1995 · 114 citations
Relation-changing modal operators: Fig. 1.
Carlos Areces, Raul Fervari, Guillaume Hoffmann · Logic Journal of IGPL · 2015 · 70 citations · Full text
Modal logics of sabotage revisited
Guillaume Aucher, Johan van Benthem, Davide Grossi · Journal of Logic and Computation · 2017 · 57 citations · Full text
On the Complexity of hybrid logics with binders
Balder ten Cate, Massimo Franceschet · 2005 · 51 citations