An Optimal Tableau System for the Logic of Temporal Neighborhood over the Reals

The propositional logic of temporal neighborhood (PNL) features two modalities that make it possible to access intervals adjacent to the right and to the left of the current one. PNL has been extensively studied in the last years. In particular, decidability and complexity of its satisfiability problem have been systematically investigated, and optimal decision procedures have been developed, for various (classes of) linear orders, including N, Z, and Q. The only missing piece is that for R. It is possible to show that PNL is expressive enough to separate Q and R. Unfortunately, there is no way to reduce the satisfiability problem for PNL over R to that over Q. In this paper, we first prove the NEXPTIME-completeness of the satisfiability problem for PNL over R, and then we devise an optimal tableau system for it.

[1]  Martin Otto,et al.  Two variable first-order logic over ordered domains , 2001, Journal of Symbolic Logic.

[2]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[3]  Dario Della Monica,et al.  The Importance of the Past in Interval Temporal Logics: The Case of Propositional Neighborhood Logic , 2012, Logic Programs, Norms and Action.

[4]  Davide Bresolin,et al.  Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions , 2009, Ann. Pure Appl. Log..

[5]  Valentin Goranko,et al.  Propositional Interval Neighborhood Temporal Logics , 2003, J. Univers. Comput. Sci..

[6]  Gabriele Puppis,et al.  Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals , 2010, ICALP.

[7]  Davide Bresolin,et al.  The Dark Side of Interval Temporal Logic: Sharpening the Undecidability Border , 2011, 2011 Eighteenth International Symposium on Temporal Representation and Reasoning.

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

[9]  Davide Bresolin,et al.  Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders , 2011, TABLEAUX.

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

[11]  Valentin Goranko,et al.  A Road Map of Interval Temporal Logics and Duration Calculi , 2004, J. Appl. Non Class. Logics.

[12]  Gabriele Puppis,et al.  A Decidable Spatial Logic with Cone-Shaped Cardinal Directions , 2009, CSL.

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

[14]  Davide Bresolin,et al.  What's Decidable about Halpern and Shoham's Interval Logic? The Maximal Fragment ABBL , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

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