Moving Arrows and Four Model Checking Results

Areces, Carlos; Fervari, Raul; Hoffmann, G. W.

doi:10.1007/978-3-642-32621-9_11

Cited by 28 publications

(56 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As such it can be viewed as the modal logic of arbitrary edge deletion. Although it inspired several later formalisms in the dynamic epistemic logic tradition [14] (e.g., graph modifiers logic [3], memory logic [1], swap logic [2], arrow update logic [8]), and is directly related to recent work in theoretical computer science (e.g., [11,7]) and learning theory (e.g., [6]) it remains a rather under-investigated logic.…”

Section: Introductionmentioning

confidence: 41%

Sabotage Modal Logic: Some Model and Proof Theoretic Aspects

Benthem

Grossi

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We investigate some model and proof theoretic aspects of sabotage modal logic. The first contribution is to prove a characterization theorem for sabotage modal logic as the fragment of first-order logic which is invariant with respect to a suitably defined notion of bisimulation (called sabotage bisimulation). The second contribution is to provide a sound and complete tableau method for sabotage modal logic. We also chart a number of open research questions concerning sabotage modal logic, aiming at integrating it within the current landscape of logics of model update.

show abstract

Section: Introductionmentioning

confidence: 41%

Sabotage Modal Logic: Some Model and Proof Theoretic Aspects

Benthem

Grossi

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This article is also relevant to other work studying graph games with modal logics, such as [9,14,18,20]. Technically, the logic SLL has resemblances to several recent logics with model modifiers, such as [2,3,4]. Besides, instead of updating links, [21] considers a logic of stepwise point deletion, which sheds light on the long-standing open problem of how to axiomatize the sabotage-style modal logics.…”

Section: Discussionmentioning

confidence: 99%

On the Right Path: A Modal Logic for Supervised Learning

Baltag

Pedersen

2019

Logic, Rationality, and Interaction

View full text Add to dashboard Cite

Formal learning theory formalizes the process of inferring a general result from examples, as in the case of inferring grammars from sentences when learning a language. Although empirical evidence suggests that children can learn a language without responding to the correction of linguistic mistakes, the importance of Teacher in many other paradigms is significant. Instead of focusing only on learner(s), this work develops a general framework-the supervised learning game (SLG)-to investigate the interaction between Teacher and Learner. In particular, our proposal highlights several interesting features of the agents: on the one hand, Learner may make mistakes in the learning process, and she may also ignore the potential relation between different hypotheses; on the other hand, Teacher is able to correct Learner's mistakes, eliminate potential mistakes and point out the facts ignored by Learner. To reason about strategies in this game, we develop a modal logic of supervised learning (SLL). Broadly, this work takes a small step towards studying the interaction between graph games, logics and formal learning theory.

show abstract

“…Finally, we say that L and L are incomparable if L L and L L . In [5,7,16,8] we discussed the expressive power of relation-changing modal logics by introducing their corresponding notions of bisimulations and using them to compare the logics among each other. We concluded that they are all incomparable in expressive power.…”

Section: Comparing Expressive Powermentioning

confidence: 99%

Relation-Changing Logics as Fragments of Hybrid Logics

Areces¹,

Fervari²,

Hoffmann³

et al. 2016

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Moving Arrows and Four Model Checking Results

Cited by 28 publications

References 9 publications

Sabotage Modal Logic: Some Model and Proof Theoretic Aspects

Sabotage Modal Logic: Some Model and Proof Theoretic Aspects

On the Right Path: A Modal Logic for Supervised Learning

Relation-Changing Logics as Fragments of Hybrid Logics

Contact Info

Product

Resources

About