Taming the complexity of temporal epistemic reasoning

  • Authors:
  • Clare Dixon;Michael Fisher;Boris Konev

  • Affiliations:
  • Department of Computer Science, University of Liverpool, Liverpool, UK;Department of Computer Science, University of Liverpool, Liverpool, UK;Department of Computer Science, University of Liverpool, Liverpool, UK

  • Venue:
  • FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Temporal logic of knowledge is a combination of temporal and epistemic logic that has been shown to be very useful in areas such as distributed systems, security, and multi-agent systems. However, the complexity of the logic can be prohibitive. We here develop a refined version of such a logic and associated tableau procedure with improved complexity but where important classes of specification can still be described. This new logic represents a combination of an "exactly one" temporal logic with an S5 multi-modal logic again restricted to the "exactly one" form.