2016/09/13 by Carlos Areces, Raul Fervari, Guillaume Hoffmann +1 · 12 citations
Computer Science · Mathematics · #Accessibility relation #Algebra over a field #Artificial intelligence #Binary relation #Computer science #Data mining #Decidability #Description logic #Discrete mathematics #Expressive power #Fuzzy logic #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Mathematics #Modal #Modal logic #Monoidal t-norm logic #Multi-Agent Systems and Negotiation #Multimodal logic #Normal modal logic #Pure mathematics #Relation (database) #Swap (finance) #T-norm fuzzy logics #Theoretical computer science #Undecidable problem #cs.LO
paper · pdf · doi:10.4204/eptcs.226.2
published in Electronic Proceedings in Theoretical Computer Science 226, 16-29 (Open Publishing Association) · In Proceedings GandALF 2016, arXiv:1609.03648
openalex publication_date 2016/09/13 · arxiv created 2016/09/14 · arxiv updated 2016/09/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.