Refinement Quantified Logics of Knowledge

Authors:
James Hales;Tim French;Rowan Davies
Affiliations:
Computer Science and Software Engineering, The University of Western Australia, Perth, Australia;Computer Science and Software Engineering, The University of Western Australia, Perth, Australia;Computer Science and Software Engineering, The University of Western Australia, Perth, Australia
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2011

Citing 5
Cited 1

Modal logic

Modal logic
Reasoning about Information Change

Journal of Logic, Language and Information
Epistemic Logic for AI and Computer Science

Epistemic Logic for AI and Computer Science
What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability

TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Simulation and Information: Quantifying over Epistemic Events

Knowledge Representation for Agents and Multi-Agent Systems

Arbitrary Action Model Logic and Action Model Synthesis

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Refinement quantifiers were introduced to quantify over all refinements of a model in modal logic, where a refinement is described by a simulation relation. Given the ''possible worlds'' interpretation of modal logic, a refinement corresponds to an agent ruling out certain possible worlds based on new information. Recent work by van Ditmarsch, French and Pinchinat has presented an axiomatization and complexity results for refinement quantifiers in the general modal logic K. Here we extend these results to apply to the epistemic and doxastic settings for a single agent.