Tableaux-based decision method for single-agent linear time synchronous temporal epistemic logics with interacting time and knowledge

In Kamal Lodaya (ed.), Logic and its Applications. Springer. pp. 80--96 (2013)
Download Edit this record How to cite View on PhilPapers
Abstract
Temporal epistemic logics are known, from results of Halpern and Vardi, to have a wide range of complexities of the satisfiability problem: from PSPACE, through non-elementary, to highly undecidable. These complexities depend on the choice of some key parameters specifying, inter alia, possible interactions between time and knowledge, such as synchrony and agents' abilities for learning and recall. In this work we develop practically implementable tableau-based decision procedures for deciding satisfiability in single-agent synchronous temporal-epistemic logics with interactions between time and knowledge. We discuss some complications that occur, even in the single-agent case, when interactions between time and knowledge are assumed and show how the method of incremental tableaux can be adapted to work in EXPSPACE, respectively 2EXPTIME, for these logics, thereby also matching the upper bounds obtained for them by Halpern and Vardi.
PhilPapers/Archive ID
AJSTDM
Upload history
Archival date: 2018-04-20
View other versions
Added to PP index
2014-01-28

Total views
80 ( #44,737 of 2,427,974 )

Recent downloads (6 months)
3 ( #58,564 of 2,427,974 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.