{"type":"ScholarlyArticle","title":"Do You Need Infinite Time?","authors":[{"name":"Alessandro Artale","slug":"alessandro-artale","given":"Alessandro","family":"Artale","affiliation":"KRDB Research Centre - Free University of Bozen-Bolzano"},{"name":"Andrea Mazzullo","slug":"andrea-mazzullo","given":"Andrea","family":"Mazzullo","affiliation":"KRDB Research Centre - Free University of Bozen-Bolzano"},{"name":"Ana Ozaki","slug":"ana-ozaki","given":"Ana","family":"Ozaki","affiliation":"KRDB Research Centre - Free University of Bozen-Bolzano"}],"abstract":"Linear temporal logic over finite traces is used as a formalism for temporal specification in automated planning, process modelling and (runtime) verification. In this paper, we investigate first-order temporal logic over finite traces, lifting some known results to a more expressive setting. Satisfiability in the two-variable monodic fragment is shown to be EXPSPACE-complete, as for the infinite trace case, while it decreases to NEXPTIME when we consider finite traces bounded in the number of instants. This leads to new complexity results for temporal description logics over finite traces. We further investigate satisfiability and equivalences of formulas under a model-theoretic perspective, providing a set of semantic conditions that characterise when the distinction between reasoning over finite and infinite traces can be blurred. Finally, we apply these conditions to planning and verification.","doi":"10.24963/ijcai.2019/210","url":"https://ijcai.org/proceedings/2019/210","pdf":"https://ijcai.org/proceedings/2019/0210.pdf","markdown":"https://ijcai.org/proceedings/2019/210.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/210","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":210,"pages":{"first":1516,"last":1522},"keywords":["Knowledge Representation and Reasoning: Description Logics and Ontologies","Knowledge Representation and Reasoning: Geometric, Spatial, and Temporal Reasoning","Knowledge Representation and Reasoning: Logics for Knowledge Representation","Knowledge Representation and Reasoning: Knowledge Representation Languages","Knowledge Representation and Reasoning: Computational Complexity of Reasoning"],"videos":[],"references":[{"position":1,"raw":"[van der Aalst and Pesic, 2006] Wil van der Aalst and Maja Pesic. Decserflow: Towards a truly declarative service flow language. In WS-FM, pages 1-23, 2006.","title":"Decserflow: Towards a truly declarative service flow language","authors":"Aalst Van Der, Pesic ; Wil Van Der Aalst, Maja Pesic","year":"2006","venue":"WS-FM","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[van der Aalst et al., 2017] Wil van der Aalst, Alessandro Ar- tale, Marco Montali, and Simone Tritini. Object-centric behavioral constraints: Integrating data and declarative pro- cess modelling. In DL, volume 1879, 2017.","title":"Object-centric behavioral constraints: Integrating data and declarative process modelling","authors":"Aalst Van Der","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Artale and Franconi, 2005] Alessandro Artale and Enrico Franconi. Temporal description logics. In Handbook of Temporal Reasoning in Artificial Intelligence, pages 375- 388. Elsevier, 2005.","title":"Temporal description logics","authors":"Artale, Franconi, Alessandro Artale, Enrico Franconi","year":"2005","venue":"Handbook of Temporal Reasoning in Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Artale et al., 2014] Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, and Michael Zakharyaschev. A cook- book for temporal conceptual data modelling with descrip- tion logics. ACM Trans. Comput. Log., 15(3):25:1-25:50, 2014.","title":"A cookbook for temporal conceptual data modelling with description logics","authors":"Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev","year":"2014","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Artale et al., 2019] Alessandro Artale, Andrea Mazzullo, and Ana Ozaki. Do you need infinite time? Techni- cal Report 01, Free University of Bozen-Bolzano, 2019. Available at https://www.inf.unibz.it/krdb/KRDB%20files/ tech-reports/KRDB19-01.pdf.","title":"Do you need infinite time? Technical Report 01","authors":"Alessandro Artale, Andrea Mazzullo, Ana Ozaki","year":"2019","venue":null,"doi":null,"url":"https://www.inf.unibz.it/krdb/KRDB%20files/tech-reports/KRDB19-01.pdf","internal_url":null},{"position":6,"raw":"[Baader and Lippmann, 2014] Franz Baader and Marcel Lippmann. Runtime verification using the temporal descrip- tion logic ALC-LTL revisited. J. Applied Logic, 12(4):584- 613, 2014.","title":"Runtime verification using the temporal description logic ALC-LTL revisited","authors":"Lippmann Baader, Franz Baader, Marcel Lippmann","year":"2014","venue":"J. Applied Logic","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Baader et al., 2012] Franz Baader, Silvio Ghilardi, and Carsten Lutz. LTL over description logic axioms. ACM Trans. Comput. Log., 13(3), 2012.","title":"LTL over description logic axioms","authors":"Baader","year":"2012","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bacchus and Kabanza, 2000] Fahiem Bacchus and Froduald Kabanza. Using temporal logics to express search control knowledge for planning. Artif. Intell., 116(1-2):123-191, 2000.","title":"Fahiem Bacchus and Froduald Kabanza. Using temporal logics to express search control knowledge for planning","authors":"Kabanza Bacchus","year":"2000","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Baier and McIlraith, 2006] Jorge A. Baier and Sheila A. McIlraith. Planning with first-order temporally extended goals using heuristic search. In AAAI, pages 788-795, 2006.","title":"Planning with first-order temporally extended goals using heuristic search","authors":"Jorge A Baier, Sheila A Mcilraith","year":"2006","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bauer and Haslum, 2010] Andreas Bauer and Patrik Haslum. LTL goal specifications revisited. In ECAI, pages 881-886, 2010.","title":"LTL goal specifications revisited","authors":"Haslum Bauer, Andreas Bauer, Patrik Haslum","year":"2010","venue":"ECAI","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Bauer et al., 2010] Andreas Bauer, Martin Leucker, and Christian Schallhart. Comparing LTL semantics for runtime verification. J. Log. Comput., 20(3):651-674, 2010.","title":"Comparing LTL semantics for runtime verification","authors":"Andreas Bauer, Martin Leucker, Christian Schallhart","year":"2010","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Camacho et al., 2017] Alberto Camacho, Eleni Triantafillou, Christian J. Muise, Jorge A. Baier, and Sheila A. McIl- raith. Non-deterministic planning with temporally extended goals: LTL over finite and infinite traces. In AAAI, pages 3716-3724, 2017.","title":"Non-deterministic planning with temporally extended goals: LTL over finite and infinite traces","authors":"Alberto Camacho, Eleni Triantafillou, Christian J Muise, Jorge A Baier, Sheila A Mcilraith","year":"2017","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Cerrito and Mayer, 1998] Serenella Cerrito and Marta Cialdea Mayer. Bounded model search in linear temporal logic and its application to planning. In TABLEAUX, pages 124-140, 1998.","title":"Bounded model search in linear temporal logic and its application to planning","authors":"Mayer ; Cerrito, Serenella Cerrito, Marta Cialdea Mayer","year":"1998","venue":"TABLEAUX","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Cerrito et al., 1999] Serenella Cerrito, Marta Cialdea Mayer, and Sébastien Praud. First order linear temporal logic over finite time structures. In LPAR, pages 62-76, 1999.","title":"First order linear temporal logic over finite time structures","authors":"Serenella Cerrito, Marta Cialdea Mayer, Sébastien Praud","year":"1999","venue":"LPAR","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[De Giacomo and Vardi, 2013] Giuseppe De Giacomo and Moshe Y. Vardi. Linear temporal logic and linear dynamic logic on finite traces. In IJCAI, pages 854-860, 2013.","title":"Linear temporal logic and linear dynamic logic on finite traces","authors":"De Giacomo, Giuseppe De Vardi, Moshe Y Giacomo, Vardi","year":"2013","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/132"},{"position":16,"raw":"[De Giacomo et al., 2014a] Giuseppe De Giacomo, Riccardo De Masellis, Marco Grasso, Fabrizio Maria Maggi, and Marco Montali. Monitoring business metaconstraints based on LTL and LDL for finite traces. In BPM, pages 1-17, 2014.","title":"Monitoring business metaconstraints based on LTL and LDL for finite traces","authors":"Giacomo De","year":"2014","venue":"BPM","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[De Giacomo et al., 2014b] Giuseppe De Giacomo, Riccardo De Masellis, and Marco Montali. Reasoning on LTL on finite traces: Insensitivity to infiniteness. In AAAI, pages 1027-1033, 2014.","title":"Reasoning on LTL on finite traces: Insensitivity to infiniteness","authors":"Giacomo De","year":"2014","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Fionda and Greco, 2016] Valeria Fionda and Gianluigi Greco. The complexity of LTL on finite traces: Hard and easy fragments. In AAAI, pages 971-977, 2016.","title":"The complexity of LTL on finite traces: Hard and easy fragments","authors":"Greco Fionda, Valeria Fionda, Gianluigi Greco","year":"2016","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Gabbay et al., 2003] Dov M. Gabbay, Agi Kurucz, Frank Wolter, and Michael Zakharyaschev. Many-dimensional Modal Logics: Theory and Applications, volume 148. Else- vier, 2003.","title":"Many-dimensional Modal Logics: Theory and Applications","authors":"Dov M Gabbay, Agi Kurucz, Frank Wolter, Michael Zakharyaschev","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Giannakopoulou and Havelund, 2001] Dimitra Gian- nakopoulou and Klaus Havelund. Automata-based verification of temporal properties on running programs. In ASE, pages 412-416, 2001.","title":"Automata-based verification of temporal properties on running programs","authors":"Dimitra Giannakopoulou, Klaus Havelund","year":"2001","venue":"ASE","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Gutiérrez-Basulto et al., 2016] Víctor Gutiérrez-Basulto, Jean Christoph Jung, and Ana Ozaki. On metric temporal description logics. In ECAI, pages 837-845, 2016.","title":"On metric temporal description logics","authors":"Gutiérrez-Basulto","year":"2016","venue":"ECAI","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Hodkinson et al., 2000] Ian M. Hodkinson, Frank Wolter, and Michael Zakharyaschev. Decidable fragment of first- order temporal logics. Annals of Pure and Applied Logic, 106(1-3):85-134, 2000.","title":"Decidable fragment of firstorder temporal logics","authors":"Ian M Hodkinson, Frank Wolter, Michael Zakharyaschev","year":"2000","venue":"Annals of Pure and Applied Logic","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Hodkinson et al., 2003] Ian M. Hodkinson, Roman Kontchakov, Agi Kurucz, Frank Wolter, and Michael Zakharyaschev. On the computational complexity of decidable fragments of first-order linear temporal logics. In TIME-ICTL, pages 91-98, 2003.","title":"On the computational complexity of decidable fragments of first-order linear temporal logics","authors":"Ian M Hodkinson, Roman Kontchakov, Agi Kurucz, Frank Wolter, Michael Zakharyaschev","year":"2003","venue":"TIME-ICTL","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Li et al., 2014] Jianwen Li, Lijun Zhang, Geguang Pu, Moshe Y. Vardi, and Jifeng He. LTL f Satisfiability Check- ing. In ECAI, pages 513-518, 2014.","title":"LTL f Satisfiability Checking","authors":"Jianwen Li, Lijun Zhang, Geguang Pu, Moshe Y Vardi, Jifeng He","year":"2014","venue":"ECAI","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Lutz et al., 2008] Carsten Lutz, Frank Wolter, and Michael Zakharyaschev. Temporal description logics: A survey. In TIME, pages 3-14, 2008.","title":"Temporal description logics: A survey","authors":"Carsten Lutz, Frank Wolter, Michael Zakharyaschev","year":"2008","venue":"TIME","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Maggi et al., 2011] Fabrizio Maria Maggi, Marco Montali, Michael Westergaard, and Wil M. P. van der Aalst. Moni- toring business constraints with linear temporal logic: An approach based on colored automata. In BPM, pages 132- 147, 2011.","title":"Monitoring business constraints with linear temporal logic: An approach based on colored automata","authors":"Maria Fabrizio, Marco Maggi, Michael Montali, Westergaard, M P Wil, Van Der Aalst","year":"2011","venue":"BPM","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Manna and Pnueli, 1995] Zohar Manna and Amir Pnueli. Temporal verification of reactive systems -Safety. Springer, 1995.","title":"Temporal verification of reactive systems -Safety","authors":"Pnueli Manna, Zohar Manna, Amir Pnueli","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Sistla, 1994] A. Prasad Sistla. Safety, liveness and fairness in temporal logic. Formal Asp. Comput., 6(5):495-512, 1994.","title":"Safety, liveness and fairness in temporal logic","authors":"A Prasad Sistla","year":"1994","venue":"Formal Asp. Comput","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Wolter and Zakharyaschev, 1998] Frank Wolter and Michael Zakharyaschev. Temporalizing description logics. In FroCoS, pages 104-109, 1998.","title":"Temporalizing description logics","authors":"Frank Wolter, Michael Zakharyaschev","year":"1998","venue":"FroCoS","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}