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

Journal of Applied Logic 4 (3):305-330 (2006)
  Copy   BIBTEX

Abstract

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.

Author's Profile

Valentin Goranko
Stockholm University

Analytics

Added to PP
2016-06-30

Downloads
111 (#53,775)

6 months
32 (#33,997)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?