25,893 research outputs found
Relation-Changing Logics as Fragments of Hybrid Logics
Relation-changing modal logics are extensions of the basic modal logic that
allow changes to the accessibility relation of a model during the evaluation of
a formula. In particular, they are equipped with dynamic modalities that are
able to delete, add, and swap edges in the model, both locally and globally. We
provide translations from these logics to hybrid logic along with an
implementation. In general, these logics are undecidable, but we use our
translations to identify decidable fragments. We also compare the expressive
power of relation-changing modal logics with hybrid logics.Comment: In Proceedings GandALF 2016, arXiv:1609.0364
Copy and remove as dynamic operators
In this article, we present a modal logic that extends the basic modal logic ML with two dynamic operators: copy (cp), which replicates the current model, labelling each copy with a different propositional symbol and respecting accessibility relations even between distinct copies; and remove (rm), which deletes paths in the model that satisfy certain intermediate conditions. We call the resulting logic ML(cp,rm). We study its computational complexity, and its relative expressivity with respect to (static) modal logics ML and ML(□−), and the dynamic epistemic Action Model Logic, AML.Fil: Areces, Carlos Eduardo. Consejo Nacional de Investigaciones CientÃficas y Técnicas. Centro CientÃfico Tecnológico Conicet - Córdoba; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, AstronomÃa y FÃsica; ArgentinaFil: Van Ditmarsch, Hans. Open University; PaÃses BajosFil: Fervari, Raul Alberto. Consejo Nacional de Investigaciones CientÃficas y Técnicas. Centro CientÃfico Tecnológico Conicet - Córdoba; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, AstronomÃa y FÃsica; ArgentinaFil: Maubert, Bastien. Università degli Studi di Napoli Federico II; ItaliaFil: Schwarzentruber, François. Universite de Rennes I; Francia. Centre National de la Recherche Scientifique; Francia. Institut de Recherche en Informatique et Systèmes Aléatoires; Franci
Tableau-based decision procedure for the multi-agent epistemic logic with operators of common and distributed knowledge
We develop an incremental-tableau-based decision procedure for the
multi-agent epistemic logic MAEL(CD) (aka S5_n (CD)), whose language contains
operators of individual knowledge for a finite set Ag of agents, as well as
operators of distributed and common knowledge among all agents in Ag. Our
tableau procedure works in (deterministic) exponential time, thus establishing
an upper bound for MAEL(CD)-satisfiability that matches the (implicit)
lower-bound known from earlier results, which implies ExpTime-completeness of
MAEL(CD)-satisfiability. Therefore, our procedure provides a complexity-optimal
algorithm for checking MAEL(CD)-satisfiability, which, however, in most cases
is much more efficient. We prove soundness and completeness of the procedure,
and illustrate it with an example.Comment: To appear in the Proceedings of the 6th IEEE Conference on Software
Engineering and Formal Methods (SEFM 2008
A Normal Form for Spider Diagrams of Order
We develop a reasoning system for an Euler diagram based visual logic, called spider diagrams of order. We de- fine a normal form for spider diagrams of order and provide an algorithm, based on the reasoning system, for producing diagrams in our normal form. Normal forms for visual log- ics have been shown to assist in proving completeness of associated reasoning systems. We wish to use the reasoning system to allow future direct comparison of spider diagrams of order and linear temporal logic
Satisfiability for relation-changing logics
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.Fil: Areces, Carlos Eduardo. Consejo Nacional de Investigaciones CientÃficas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, AstronomÃa y FÃsica. Sección Ciencias de la Computación; ArgentinaFil: Fervari, Raul Alberto. Consejo Nacional de Investigaciones CientÃficas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, AstronomÃa y FÃsica. Sección Ciencias de la Computación; ArgentinaFil: Hoffmann, Guillaume Emmanuel. Universidad Nacional de Córdoba. Facultad de Matemática, AstronomÃa y FÃsica. Sección Ciencias de la Computación; Argentina. Consejo Nacional de Investigaciones CientÃficas y Técnicas; ArgentinaFil: Martel, Mauricio. Universitat Bremen; Alemani
- …