A general tableau method for propositional interval temporal logics: Theory and implementation

Journal of Applied Logic 4 (3):305-330 (2006)
Download Edit this record How to cite View on PhilPapers
In this paper we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema's \cdt\ logic interpreted over partial orders (\nsbcdt\ for short). It combines features of the classical tableau method for first-order logic with those of explicit tableau methods for modal logics with constraint label management, and it can be easily tailored to most propositional interval temporal logics proposed in the literature. We prove its soundness and completeness, and we show how it has been implemented.
PhilPapers/Archive ID
Upload history
Archival date: 2018-04-21
View other versions
Added to PP index

Total views
67 ( #52,297 of 64,190 )

Recent downloads (6 months)
5 ( #58,628 of 64,190 )

How can I increase my downloads?

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