Logics of communication and change
Reads0
Chats0
TLDR
New systems that extend the epistemic base language with a new notion of 'relativized common knowledge' are proposed, in such a way that the resulting full dynamic logic of information flow allows for a compositional analysis of all epistemic postconditions via perspicuous 'reduction axioms'.Abstract:
Current dynamic epistemic logics for analyzing effects of informational events often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions involving common knowledge are essential to successful multi-agent communication. We propose new systems that extend the epistemic base language with a new notion of 'relativized common knowledge', in such a way that the resulting full dynamic logic of information flow allows for a compositional analysis of all epistemic postconditions via perspicuous 'reduction axioms'. We also show how such systems can deal with factual alteration, rather than just information change, making them cover a much wider range of realistic events. After a warmup stage of analyzing logics for public announcements, our main technical results are expressivity and completeness theorems for a much richer logic that we call LCC. This is a dynamic epistemic logic whose static base is propositional dynamic logic (PDL), interpreted epistemically. This system is capable of expressing all model-shifting operations with finite action models, while providing a compositional analysis for a wide range of informational events. This makes LCC a serious candidate for a standard in dynamic epistemic logic, as we illustrate by analyzing some complex communication scenarios, including sending successive emails with both 'cc' and 'bcc' lines, and other private announcements to subgroups. Our proofs involve standard modal techniques, combined with a new application of Kleene's theorem on finite automata, as well as new Ehrenfeucht games of model comparison.read more
Citations
More filters
Book
Dynamic Epistemic Logic
TL;DR: This book provides various logics to support formal specifications of multi-agent systems, including proof systems, and discusses various results on the expressive power of the logics presented.
Journal ArticleDOI
Dynamic logic for belief revision
TL;DR: This work shows how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added, and obtains complete logics for concrete mechanisms of belief revision based on compositional reduction axioms.
Book
Logical Dynamics of Information and Interaction
TL;DR: A new view of logic as a theory of information-driven agency and intelligent interaction between many agents is developed, unifying all these systems, and positioning them at the interface of logic, philosophy, computer science and game theory.
Book ChapterDOI
A qualitative theory of dynamic interactive belief revision
Alexandru Baltag,Sonja Smets +1 more
TL;DR: A logical setting is presented that incorporates a belief-revision mechanism within Dynamic-Epistemic logic, and it is shown how the update mechanism can “simulate”, in a uniform manner, many different belief- revision policies.
Book ChapterDOI
Dynamic Epistemic Logic and Knowledge Puzzles
TL;DR: The logic of public announcements in DEL is applied to the analysis of a knowledge puzzle, called `What Sum', and it is shown how factual change can be modelled in the same framework.
References
More filters
Book
Reasoning About Knowledge
TL;DR: Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed systems, artificial intelligence, and game theory.
Book ChapterDOI
Representation of Events in Nerve Nets and Finite Automata
TL;DR: This memorandum is devoted to an elementary exposition of the problems and of results obtained on the McCulloch-Pitts nerve net during investigations in August 1951.
Book
Dynamic Logic
TL;DR: This book provides the first comprehensive introduction to Dynamic Logic, a system of remarkable unity that is theoretically rich as well as of practical value.
Journal ArticleDOI
Propositional dynamic logic of regular programs
TL;DR: A formal syntax and semantics for the propositional dynamic logic of regular programs is defined and principal conclusions are that deciding satisfiability of length n formulas requires time d n /log n for some d > 1, and that satisfiability can be decided in nondeterministic time cn for some c.
Book
Elements of the Theory of Computation
TL;DR: Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book, each section is followed by problems.