Public announcements, public assignments and the complexity of their logic

DOI10.1080/11663081.2012.705964zbMath1398.03076OpenAlexW2065423509MaRDI QIDQ4583171

Andreas Herzig, Tiago de Lima, Hans P. van Ditmarsch

Publication date: 28 August 2018

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2012.705964

zbMATH Keywords

complexityautomated theorem provingdynamic epistemic logicknowledge representation and reasoningreduction axiomspublic announcementspublic assignments

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Argumentation update in YALLA (yet another logic language for argumentation) ⋮ The modal logic of copy and remove ⋮ Copy and remove as dynamic operators

Cites Work

• Knowledge, action, and the frame problem
• Logics of communication and change
• Dynamic epistemic logic
• Reasoning about noisy sensors and effectors in the situation calculus
• The Logic of Public Announcements, Common Knowledge, and Private Suspicions
• From Situation Calculus to Dynamic Epistemic Logic
• Expressivity and completeness for public update logics via reduction axioms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Public announcements, public assignments and the complexity of their logic