Interpreting logics of knowledge in propositional dynamic logic

DOI10.1016/0020-0190(87)90129-3zbMATH Open0634.03012OpenAlexW2086062372MaRDI QIDQ1096609FDOQ1096609

Michael Fischer, Neil Immerman

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90129-3

zbMATH Keywords

interpretationsemanticsdistributed systemsdistributed protocolbranching timesatisfiability problemKripke modelparticipantsPropositional Dynamic LogicPropositional Temporal Knowledge Logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99) Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Theory of operating systems (68N25)

Cites Work

• Title not available (Why is that?)
• Propositional dynamic logic of regular programs
• Propositional dynamic logic of looping and converse is elementarily decidable
• Decision procedures and expressiveness in the temporal logic of branching time
• Knowledge and common knowledge in a distributed environment

Cited In (4)

• A PDL-Like Logic of Knowledge Acquisition
• A guide to completeness and complexity for modal logics of knowledge and belief
• The complexity of reasoning about knowledge and time. I: Lower bounds
• TABLEAUX: A general theorem prover for modal logics

This page was built for publication: Interpreting logics of knowledge in propositional dynamic logic

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