Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL

DOI10.1109/LICS.2013.20zbMath1366.03208OpenAlexW1966759732MaRDI QIDQ5271051

Philippe Balbiani, Nicolas Troquard, Andreas Herzig

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2013.20

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (11)

A Poor Man’s Epistemic Logic Based on Propositional Assignment and Higher-Order Observation ⋮ Abstract argumentation with qualitative uncertainty: an analysis in dynamic logic ⋮ Unnamed Item ⋮ Capturing equilibrium models in modal logic ⋮ Possible Worlds Semantics Based on Observation and Communication ⋮ Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change ⋮ Resource separation in dynamic logic of propositional assignments ⋮ A logic for diffusion in social networks ⋮ Channel Theoretic Reflections on Dynamic Logics of Speech Acts ⋮ Towards Contingent World Descriptions in Description Logics ⋮ Database repair via event-condition-action rules in dynamic logic

This page was built for publication: Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL