scientific article; zbMATH DE number 7084828

MaRDI QIDQ5224562zbMATH OpenFDO

Authors Tristan Charrier, François Schwarzentruber

Publication date 24 July 2019

zbMATH Keywords

common knowledgecomplexity theorydynamic epistemic logic

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Relativized common knowledge for dynamic epistemic logic
• scientific article; zbMATH DE number 2149447
• Dynamic epistemic logics
• Dynamic Epistemic Logic and Knowledge Puzzles
• Dynamic epistemic logic
• scientific article; zbMATH DE number 1537935
• A Dynamic Epistemic Logic with a Knowability Principle
• On a variant of dynamic-epistemic logic
• Dynamic epistemic logic for implicit and explicit beliefs
• Parameterized complexity of theory of mind reasoning in dynamic epistemic logic

Cited in

(9)

• A guide to completeness and complexity for modal logics of knowledge and belief
• Parameterized complexity of theory of mind reasoning in dynamic epistemic logic
• Parameterized complexity of dynamic belief updates
• A computationally grounded logic of graded belief
• The undecidability of iterated modal relativization
• On the computational complexity of model checking for dynamic epistemic logic with S5 models
• Reasoning about common knowledge with infinitely many agents
• Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard
• Agreement theorems in dynamic-epistemic logic

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224562)