Tableaux for Logics of Subinterval Structures over Dense Orderings

In this article, we develop tableau-based decision procedures for the logics of subinterval structures over dense linear orderings. In particular, we consider the two difficult cases: the relation of strict subintervals (with both endpoints strictly inside the current interval) and the relation of proper subintervals (that can share one endpoint with the current interval). For each of these logics, we establish a small pseudo-model property and construct a sound, complete and terminating tableau that searches systematically for existence of such a pseudo-model satisfying the input formulas. Both constructions are non-trivial, but the latter is substantially more complicated because of the presence of beginning and ending subintervals which require special treatment. We prove PSPACE completeness for both procedures and implement them in the generic tableau-based theorem prover Lotrec.

[1]  Valentin B. Shehtman,et al.  Chronological Future Modality in Minkowski Spacetime , 2002, Advances in Modal Logic.

[2]  Dimitar P. Guelev,et al.  Completeness and Decidability of a Fragment of Duration Calculus with Iteration , 1999, ASIAN.

[3]  Louise E. Moser,et al.  A real-time interval logic and its decision procedure , 1993, FSTTCS.

[4]  Dominique Longin,et al.  Lotrec : The Generic Tableau Prover for Modal and Description Logics , 2001, IJCAR.

[5]  Howard Bowman,et al.  A Decision Procedure and Complete Axiomatization of Finite Interval Temporal Logic with Projection , 2003, J. Log. Comput..

[6]  Davide Bresolin,et al.  An Optimal Decision Procedure for Right Propositional Neighborhood Logic , 2006, Journal of Automated Reasoning.

[7]  Davide Bresolin,et al.  On Decidability and Expressiveness of Propositional Interval Neighborhood Logics , 2007, LFCS.

[8]  Yoav Shoham,et al.  A propositional modal logic of time intervals , 1991, JACM.

[9]  Bresolin Davide,et al.  A tableau-based decision procedure for a branching-time interval temporal logic , 2005 .

[10]  Davide Bresolin,et al.  Tableau Systems for Logics of Subinterval Structures over Dense Orderings , 2007, TABLEAUX.

[11]  Davide Bresolin,et al.  An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic , 2007, STACS.

[12]  Guido Sciavicco,et al.  Decidability of Interval Temporal Logics over Split-Frames via Granularity , 2002, JELIA.

[13]  Howard Bowman,et al.  A Tableau Method for Interval Temporal Logic with Projection , 1998, TABLEAUX.

[14]  Davide Bresolin,et al.  A Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic , 2005, TABLEAUX.

[15]  Ilya Shapirovsky.  On PSPACE-decidability in Transitive Modal Logic , 2004, Advances in Modal Logic.

[16]  Johan van Benthem,et al.  The logic of time - a model-theoretic investigation into the varieties of temporal ontology and temporal discourse, 2nd Edition , 1982, Synthese library.

[17]  Michael R. Hansen,et al.  Decidability and Undecidability Results for Duration Calculus , 1993, STACS.

[18]  A. A. Aaby,et al.  Propositional Temporal Interval Logic is PSPACE Complete , 1988, CADE.

[19]  Luis Fariñas del Cerro,et al.  Modal Tableaux with Propagation Rules and Structural Rules , 1997, Fundam. Informaticae.

[20]  Kamal Lodaya,et al.  Sharpening the Undecidability of Interval Temporal Logic , 2000, ASIAN.

[21]  Louise E. Moser,et al.  Interval Logics and Their Decision Procedures, Part I: An Interval Logic , 1996, Theor. Comput. Sci..