An epistemic Halpern-Shoham logic

Authors:
Alessio R. Lomuscio;Jakub Michaliszyn
Affiliations:
Department of Computing, Imperial College London, UK;Department of Computing, Imperial College London, UK
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 14
Cited 0

A propositional modal logic of time intervals

Journal of the ACM (JACM)
A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
Reasoning about knowledge

Reasoning about knowledge
On reduction-based process semantics

Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
The benefits of relaxing punctuality

Journal of the ACM (JACM)
Model checking

Model checking
Maintaining knowledge about temporal intervals

Communications of the ACM
Reasoning about digital circuits

Reasoning about digital circuits
Bounded model checking for knowledge and real time

Artificial Intelligence
A symmetry reduction technique for model checking temporal-epistemic logic

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
The Ultimate Undecidability Result for the Halpern-Shoham Logic

LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
The Dark Side of Interval Temporal Logic: Sharpening the Undecidability Border

TIME '11 Proceedings of the 2011 Eighteenth International Symposium on Temporal Representation and Reasoning
The complexity of model checking concurrent programs against CTLK specifications

DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
Expressiveness of the interval logics of Allen's relations on the class of all linear orders: complete classification

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a family of epistemic extensions of Halpern-Shoham logic for reasoning about temporal-epistemic properties of multi-agent systems. We exemplify their use and study the complexity of their model checking problem. We show a range of results ranging from PTIME to PSPACE-hard depending on the logic considered.