Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers

Interval temporal logics provide a natural framework for qualitative and quantitative temporal reasoning over interval structures, where the truth of formulas is defined over intervals rather than points. In this paper, we study the complexity of the satisfiability problem for Metric Propositional Neighborhood Logic (MPNL). MPNL features two modalities to access intervals ''to the left'' and ''to the right'' of the current one, respectively, plus an infinite set of length constraints. MPNL has been recently shown to be decidable over finite linear orders and the natural numbers by a doubly exponential procedure, leaving the tightness of the complexity bound as an open problem. We improve such a result by proving that the satisfiability problem for MPNL over finite linear orders and the natural numbers, as well as over the integers, is actually EXPSPACE-complete, even when length constraints are encoded in binary.

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

[2]  Davide Bresolin,et al.  Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders , 2008, JELIA.

[3]  Yde Venema,et al.  A Modal Logic for Chopping Intervals , 1991, J. Log. Comput..

[4]  Dario Della Monica.  Expressiveness, decidability, and undecidability of interval temporal logic , 2011 .

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

[6]  Davide Bresolin,et al.  Metric propositional neighborhood logics on natural numbers , 2011, Software & Systems Modeling.

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

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

[9]  Davide Bresolin,et al.  Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths , 2009, 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods.

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

[11]  Yde Venema,et al.  Expressiveness and Completeness of an Interval Tense Logic , 1990, Notre Dame J. Formal Log..

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

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

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

[15]  Michael R. Hansen,et al.  An Adequate First Order Interval Logic , 1997, COMPOS.

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

[17]  Davide Bresolin,et al.  Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability , 2010, ECAI.