A combination of explicit and deductive knowledge with branching time: completeness and decidability results

  • Authors:
  • Alessio Lomuscio;Bożena Woźna

  • Affiliations:
  • Department of Computer Science, University College London, London, United Kingdom;Department of Computer Science, University College London, London, United Kingdom

  • Venue:
  • DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Logics for knowledge and time comprise logic combinations between epistemic logic S5n for n agents and temporal logic. In this paper we examine a logic combination of Computational Tree Logic and an epistemic logic augmented to include an additional epistemic operator representing explicit knowledge. We show the resulting system enjoys the finite model property, decidability and is finitely axiomatisable. It is further shown that the expressivity of the resulting system enables us to represent a non-standard notion of deductive knowledge which seems promising for applications.