The Complexity of LTL on Finite Traces: Hard and Easy Fragments

This paper focuses on LTL on finite traces (LTLf) for which satisfiability is known to be PSPACE-complete. However, little is known about the computational properties of fragments of LTLf. In this paper we fill this gap and make the following contributions. First, we identify several LTLf fragments for which the complexity of satisfiability drops to NP-complete or even P, by considering restrictions on the temporal operators and Boolean connectives being allowed. Second, we study a semantic variant of LTLf, which is of interest in the domain of business processes, where models have the property that precisely one propositional variable evaluates true at each time instant. Third, we introduce a reasoner for LTLf and compare its performance with the state of the art.

[1]  Alessandro Artale,et al.  The Complexity of Clausal Fragments of LTL , 2013, LPAR.

[2]  Nicolas Markey.  Past is for free: on the complexity of verifying linear temporal properties with past , 2003, Acta Informatica.

[3]  Gilles Audemard,et al.  Predicting Learnt Clauses Quality in Modern SAT Solvers , 2009, IJCAI.

[4]  Pierre-Yves Schobbens,et al.  The Logic of "Initially" and "Next": Complete Axiomatization and Complexity , 1999, Inf. Process. Lett..

[5]  Heribert Vollmer,et al.  The Complexity of Generalized Satisfiability for Linear Temporal Logic , 2006, Electron. Colloquium Comput. Complex..

[6]  Wil M. P. van der Aalst,et al.  DecSerFlow: Towards a Truly Declarative Service Flow Language , 2006, WS-FM.

[7]  I-Peng Lin,et al.  The Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic , 1993, Inf. Process. Lett..

[8]  Giuseppe De Giacomo,et al.  Linear Temporal Logic and Linear Dynamic Logic on Finite Traces , 2013, IJCAI.

[9]  Patrik Haslum,et al.  Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners , 2009, Artif. Intell..

[10]  Gianluigi Greco,et al.  The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions , 2013, Artif. Intell..

[11]  Georg Gottlob,et al.  Decomposing combinatorial auctions and set packing problems , 2013, J. ACM.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Dragan Bosnacki,et al.  Enacting Declarative Languages Using LTL: Avoiding Errors and Improving Performance , 2010, SPIN.

[14]  Clare Dixon,et al.  Tractable Temporal Reasoning , 2007, IJCAI.

[15]  Stefan Edelkamp,et al.  On the Compilation of Plan Constraints and Preferences , 2006, ICAPS.

[16]  Amir Pnueli.  The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[17]  Wil M. P. van der Aalst,et al.  DECLARE: Full Support for Loosely-Structured Processes , 2007, 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007).

[18]  Philippe Schnoebelen,et al.  The Complexity of Propositional Linear Temporal Logics in Simple Cases , 1998, Inf. Comput..

[19]  Giuseppe De Giacomo,et al.  Synthesis for LTL and LDL on Finite Traces , 2015, IJCAI.

[20]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[21]  Marco Montali,et al.  Reasoning on LTL on Finite Traces: Insensitivity to Infiniteness , 2014, AAAI.

[22]  Marco Montali,et al.  Monitoring Business Metaconstraints Based on LTL and LDL for Finite Traces , 2014, BPM.

[23]  Jorge A. Baier,et al.  Planning with First-Order Temporally Extended Goals using Heuristic Search , 2006, AAAI.

[24]  A. Nakamura,et al.  On the size of refutation Kripke models for some linear modal and tense logics , 1980 .

[25]  Viktor Schuppan,et al.  Linear Encodings of Bounded LTL Model Checking , 2006, Log. Methods Comput. Sci..

[26]  Edith Hemaspaandra.  The Complexity of Poor Man's Logic , 2001, J. Log. Comput..

[27]  Lijun Zhang,et al.  LTLf Satisfiability Checking , 2014, ECAI.

[28]  Luigi Pontieri,et al.  Process Discovery under Precedence Constraints , 2015, TKDD.

[29]  Wil M. P. van der Aalst,et al.  Declarative workflows: Balancing between flexibility and support , 2009, Computer Science - Research and Development.