Dynamic Epistemic Logic

Ditmarsch, Hans van; Hoek, Wiebe van der; Kooi, Barteld

doi:10.1007/978-1-4020-5839-4

Cited by 941 publications

(922 citation statements)

References 42 publications

Supporting

Mentioning

912

Contrasting

Unclassified

Order By: Relevance

“…To this aim, we introduce special events whose effect is to delete a strictly dominated strategy from the current game. These events are similar to announcements in Dynamic Epistemic Logic (DEL) [13]. L AN is the set of announcable formulas and is defined by the following BNF: χ ::= ψ → [i:a] ⊥ | χ ∧ χ where ψ ∈ L EDLA , i ∈ Agt and a ∈ Act.…”

Section: Game Transformationmentioning

confidence: 99%

“…Section 3 is devoted to the analysis in EDLA of the epistemic conditions of Nash equilibrium and IDSDS. In Section 4 we make EDLA dynamic by extending it with constructions of Dynamic Epistemic Logic (DEL) [13], and we show that this dynamic version of EDLA allows to express IDSDS in a more compact way than in the static EDLA. In Section 5 we show how our logical framework can be applied to the analysis of strategic interaction with imperfect information about the 1 game structure.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Epistemic Games in Modal Logic: Joint Actions, Knowledge and Preferences All Together

Lorini

Schwarzentruber

Herzig

2009

Logic, Rationality, and Interaction

View full text Add to dashboard Cite

We present in this work a sound and complete modal logic called EDLA (Epistemic Dynamic Logic of Agency) integrating the concepts of joint action, preference and knowledge and enabling to reason about epistemic games in strategic form. We provide complexity results for EDLA. In the second part of the paper, we study in EDLA the epistemic and rationality conditions of some classical solution concepts like Nash equilibrium and Iterated Deletion of Strictly Dominated Strategies (IDSDS). In the last part of the paper we combine EDLA with Dynamic Epistemic Logic (DEL) in order to model epistemic game dynamics.

show abstract

Section: Game Transformationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Epistemic Games in Modal Logic: Joint Actions, Knowledge and Preferences All Together

Lorini

Schwarzentruber

Herzig

2009

Logic, Rationality, and Interaction

View full text Add to dashboard Cite

show abstract

“…We present a novel proposal to tackle this problem in the setting of dynamic epistemic logic [2], where the knowledge of the agents involved in protocol execution, including higher-order features (what agents know about each other), is represented in relational structures called multi-agent Kripke models, and change of knowledge is represented by various structural transformations. In this setting agents are also computationally unlimited.…”

Section: Introductionmentioning

confidence: 99%

Modelling Cryptographic Keys in Dynamic Epistemic Logic with DEMO

Ditmarsch¹,

Eijck²,

Hernández-Antón³

et al. 2012

Advances in Intelligent and Soft Computing

Self Cite

View full text Add to dashboard Cite

It is far from obvious to find logical counterparts to crytographic protocol primitives. In logic, a common assumption is that agents are perfectly rational and have no computational limitations. This creates a dilemma. If one merely abstracts from computational aspects, protocols become trivial and the difference between tractable and intractable computation, surely an essential feature of protocols, disappears. This way, the protocol gets lost. On the other hand, if one 'merely' (scare quotes indeed) models agents with computational limitations (or otherwise bounded rationality), very obvious aspects of reasoning become problematic. That way, the logic gets lost. We present a novel way out of this dilemma. We propose an abstract logical architecture wherein public and private, or symmetric keys, and their roles in crytographic protocols, all have formal counterparts. Instead of having encryption and decryption done by a principal, the agent sending or receiving messages, we introduce additional, virtual, agents to model that, so that one-way-function aspects of computation can be modelled as constraints on the communication between principals and these virtual counterparts. In this modelling it does not affect essential protocol features if agents are computationally unlimited. We have implemented the proposal in a dynamic epistemic model checker called DEMO.

show abstract

“…As with dynamic epistemic logic [5] where an agent may learn new facts about the world, we may consider awareness dynamics where an agent may become aware of new properties in the world. Becoming aware should leave the agent in an enlightened state, and able to accumulate new knowledge (with respect to the properties of which the agent is newly aware) that is compatible with what the agent already knows.…”

Section: Introductionmentioning

confidence: 99%

On the Interactions of Awareness and Certainty

Ditmarsch

French

2011

AI 2011: Advances in Artificial Intelligence

Self Cite

View full text Add to dashboard Cite

Abstract. We examine the interactions of knowledge and awareness in dynamic epistemic logic. Implicit knowledge describes the things that an agent could infer from what is known, if the agent were aware of the necessary concepts. Reasoning techniques that are robust to incomplete awareness are important when considering interactions of automated agents in complex dynamic environments, such as the semantic web. Here we revisit Hector Levesque's original motivation of implicit knowledge and consider several contemporary realizations of implicit knowledge. We present a framework to compare different interactions of knowledge and awareness in the context of public announcements, and introduce a new formalism for tacit knowledge.

show abstract

Dynamic Epistemic Logic

Cited by 941 publications

References 42 publications

Epistemic Games in Modal Logic: Joint Actions, Knowledge and Preferences All Together

Epistemic Games in Modal Logic: Joint Actions, Knowledge and Preferences All Together

Modelling Cryptographic Keys in Dynamic Epistemic Logic with DEMO

On the Interactions of Awareness and Certainty

Contact Info

Product

Resources

About