{"type":"ScholarlyArticle","title":"LTL on Weighted Finite Traces: Formal Foundations and Algorithms","authors":[{"name":"Carmine Dodaro","slug":"carmine-dodaro","given":"Carmine","family":"Dodaro","affiliation":"Department of Mathematics and Computer Science , University of Calabria"},{"name":"Valeria Fionda","slug":"valeria-fionda","given":"Valeria","family":"Fionda","affiliation":"Department of Mathematics and Computer Science , University of Calabria"},{"name":"Gianluigi Greco","slug":"gianluigi-greco","given":"Gianluigi","family":"Greco","affiliation":"Department of Mathematics and Computer Science , University of Calabria"}],"abstract":"LTL on finite traces (LTLf ) is a logic that attracted much attention in recent literature, for its ability to formalize the qualitative behavior of dynamical systems in several application domains. However, its practical usage is still rather limited, as LTLf cannot deal with any quantitative aspect, such as with the costs of realizing some desired behaviour. The paper fills the gap by proposing a weighting framework for LTLf encoding such quantitative aspects in the traces over which it is evaluated. The complexity of reasoning problems on weighted traces is analyzed and compared to that of standard LTLf, by considering arbitrary formulas as well as classes of formulas defined in terms of relevant syntactic restrictions. Moreover, a reasoner for LTL on weighted finite traces is presented, and its performances are assessed on benchmark data.","doi":"10.24963/ijcai.2022/361","url":"https://ijcai.org/proceedings/2022/361","pdf":"https://ijcai.org/proceedings/2022/0361.pdf","markdown":"https://ijcai.org/proceedings/2022/361.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/361","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":361,"pages":{"first":2606,"last":2612},"keywords":["Knowledge Representation and Reasoning: Learning and reasoning","Knowledge Representation and Reasoning: Knowledge Representation Languages"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986810","length_sec":86,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38984953","length_sec":361,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Almagor et al., 2016] Shaull Almagor, Udi Boker, and Orna Kupferman. Formally reasoning about quality. Journal of the ACM, 63(3):24:1-24:56, 2016.","title":"Formally reasoning about quality","authors":"Shaull Almagor, Udi Boker, Orna Kupferman","year":"2016","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alur et al., 2001] Rajeev Alur, Kousha Etessami, Salva- tore La Torre, and Doron A. Peled. Parametric temporal logic for \"model measuring\". ACM Trans. on Computional Logics, 2(3):388-407, 2001.","title":"Parametric temporal logic for \"model measuring","authors":"Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron A Peled","year":"2001","venue":"ACM Trans. on Computional Logics","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baier et al., 2014] Christel Baier, Joachim Klein, Sascha Klüppelholz, and Sascha Wunderlich. Weight monitoring with linear temporal logic: complexity and decidability. In Proc. of CSL-LICS, pages 11:1-11:10. ACM, 2014.","title":"Weight monitoring with linear temporal logic: complexity and decidability","authors":"Christel Baier, Joachim Klein, Sascha Klüppelholz, Sascha Wunderlich","year":"2014","venue":"Proc. of CSL-LICS","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bouyer et al., 2014] Patricia Bouyer, Nicolas Markey, and Raj Mohan Matteplackel. Averaging in LTL. In Proc. of CONCUR, pages 266-280, 2014.","title":"Averaging in LTL","authors":"Patricia Bouyer, Nicolas Markey, Raj Mohan Matteplackel","year":"2014","venue":"Proc. of CONCUR","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Brewka et al., 2011] Gerhard Brewka, Thomas Eiter, and Miroslaw Truszczynski. Answer set programming at a glance. Commun. ACM, 54(12):92-103, 2011.","title":"Answer set programming at a glance","authors":"Gerhard Brewka, Thomas Eiter, Miroslaw Truszczynski","year":"2011","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Camacho et al., 2018b] Alberto Camacho, Meghyn Bien- venu, and Sheila A. McIlraith. Finite LTL synthesis with environment assumptions and quality measures. In Proc. of KR, pages 454-463, 2018.","title":"Finite LTL synthesis with environment assumptions and quality measures","authors":"Camacho","year":"2018","venue":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[de Alfaro et al., 2004] Luca de Alfaro, Marco Faella, and Mariëlle Stoelinga. Linear and branching metrics for quan- titative transition systems. In Proc. of ICALP, pages 97- 109, 2004.","title":"Linear and branching metrics for quantitative transition systems","authors":"De Alfaro","year":"2004","venue":"Proc. of ICALP","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[de Alfaro et al., 2005] Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, and Mariëlle Stoelinga. Model checking discounted temporal proper- ties. Theor. Comput. Sci., 345(1):139-170, 2005.","title":"Model checking discounted temporal properties","authors":"Marco Luca De Alfaro, Thomas A Faella, Rupak Henzinger, Mariëlle Majumdar, Stoelinga","year":"2005","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[De Giacomo and Vardi, 2013] Giuseppe De Giacomo and M. Y. Vardi. Linear Temporal Logic and Linear Dynamic Logic on Finite Traces. In Proc. of IJCAI, pages 854-860.","title":"Linear Temporal Logic and Linear Dynamic Logic on Finite Traces","authors":"De Giacomo, Giuseppe Vardi, Giacomo De, M Y Vardi","year":"2013","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/132"},{"position":10,"raw":"[De Giacomo et al., 2014a] Giuseppe De Giacomo, Ric- cardo De Masellis, Marco Grasso, Fabrizio M. Maggi, and Marco Montali. Monitoring Business Metaconstraints Based on LTL and LDL for Finite Traces. In Proc. of BPM, pages 1-14, 2014.","title":"Monitoring Business Metaconstraints Based on LTL and LDL for Finite Traces","authors":"Giacomo De","year":"2014","venue":"Proc. of BPM","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[De Giacomo et al., 2014b] Giuseppe De Giacomo, Riccardi De Masellis, and Marco Montali. Reasoning on LTL on Fi- nite Traces: Insensitivity to Infiniteness. In Proc. of AAAI, pages 1027-1033, 2014.","title":"Reasoning on LTL on Finite Traces: Insensitivity to Infiniteness","authors":"Giacomo De","year":"2014","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[De Giacomo and Rubin, 2018] Giuseppe De Giacomo and Sasha Rubin. Automata-theoretic foundations of FOND planning for LTLf and LDLf goals. In Proc. of IJCAI, pages 4729-4735, 2018.","title":"Automata-theoretic foundations of FOND planning for LTLf and LDLf goals","authors":"De Giacomo, Rubin, Giuseppe De, Giacomo, Sasha Rubin","year":"2018","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/657"},{"position":13,"raw":"[De Giacomo and Vardi, 2015] Giuseppe De Giacomo and Moshe Y. Vardi. Synthesis for LTL and LDL on finite traces. In Proc. of IJCAI, pages 1558-1564, 2015.","title":"Synthesis for LTL and LDL on finite traces","authors":"De Giacomo, Giuseppe De Vardi, Moshe Y Giacomo, Vardi","year":"2015","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/223"},{"position":14,"raw":"[Droste and Rahonis, 2016] Manfred Droste and George Ra- honis. Weighted linear dynamic logic. In Proc. of EPTCS, volume 226, pages 149-163, 2016.","title":"Manfred Droste and George Rahonis","authors":"Rahonis Droste","year":"2016","venue":"Proc. of EPTCS","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Droste and Vogler, 2012] Manfred Droste and Heiko Vogler. Weighted automata and multi-valued logics over arbitrary bounded lattices. TCS, 418:14-36, 2012.","title":"Weighted automata and multi-valued logics over arbitrary bounded lattices","authors":"Vogler Droste, Manfred Droste, Heiko Vogler","year":"2012","venue":"TCS","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Faber et al., 2011] Wolfgang Faber, Gerald Pfeifer, and Nicola Leone. Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell., 175(1):278-298, 2011.","title":"Semantics and complexity of recursive aggregates in answer set programming","authors":"Faber","year":"2011","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Faella et al., 2008] Marco Faella, Axel Legay, and Mariëlle Stoelinga. Model checking quantitative linear time logic. E. N. in Theor. Comput. Sci., 220(3):61-77, 2008.","title":"Model checking quantitative linear time logic","authors":"Marco Faella, Axel Legay, Mariëlle Stoelinga","year":"2008","venue":"E. N. in Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Fionda and Greco, 2018] Valeria Fionda and Gianluigi Greco. LTL on finite and process traces: Complexity results and a practical reasoner. J. Artif. Intell. Res., 63:557-623, 2018.","title":"LTL on finite and process traces: Complexity results and a practical reasoner","authors":"Greco Fionda, Valeria Fionda, Gianluigi Greco","year":"2018","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Gebser et al., 2018] Martin Gebser, Nicola Leone, Marco Maratea, Simona Perri, Francesco Ricca, and Torsten Schaub. Evaluation techniques and systems for answer set programming: a survey. In Proc. of IJCAI'18, pages 5450-5456, 2018.","title":"Evaluation techniques and systems for answer set programming: a survey","authors":"Martin Gebser, Nicola Leone, Marco Maratea, Simona Perri, Francesco Ricca, Torsten Schaub","year":"2018","venue":"Proc. of IJCAI'18","doi":null,"url":null,"internal_url":"/proceedings/2018/769"},{"position":20,"raw":"[Kuperberg, 2014] Denis Kuperberg. Linear temporal logic for regular cost functions. Log. Methods Comput. Sci., 10(1), 2014.","title":"Linear temporal logic for regular cost functions","authors":"Denis Kuperberg","year":"2014","venue":"Log. Methods Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Kupferman and Lustig, 2007] Orna Kupferman and Yoad Lustig. Lattice automata. In Proc. of VMCAI, pages 199- 213, 2007.","title":"Lattice automata","authors":"Lustig Kupferman, Orna Kupferman, Yoad Lustig","year":"2007","venue":"Proc. of VMCAI","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Kupferman et al., 2009] Orna Kupferman, Nir Piterman, and Moshe Y. Vardi. From liveness to promptness. Formal Methods in System Design, 34(2):83-103, 2009.","title":"From liveness to promptness","authors":"Orna Kupferman, Nir Piterman, Moshe Y Vardi","year":"2009","venue":"Formal Methods in System Design","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lahijanian et al., 2015] Morteza Lahijanian, Shaull Al- magor, Dror Fried, Lydia E. Kavraki, and Moshe Y. Vardi. This time the robot settles for a cost: A quantitative ap- proach to temporal logic planning with partial satisfaction. In Proc. of AAAI, pages 3664-3671, 2015.","title":"This time the robot settles for a cost: A quantitative approach to temporal logic planning with partial satisfaction","authors":"Morteza Lahijanian, Shaull Almagor, Dror Fried, Lydia E Kavraki, Moshe Y Vardi","year":"2015","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Li et al., 2020] Jianwen Li, Geguang Pu, Yueling Zhang, Moshe Y. Vardi, and Kristin Y. Rozier. Sat-based explicit ltlf satisfiability checking. Artif. Intell., 289:103369, 2020.","title":"Sat-based explicit ltlf satisfiability checking","authors":"Jianwen Li, Geguang Pu, Yueling Zhang, Moshe Y Vardi, Kristin Y Rozier","year":"2020","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Mandrali, 2012] Eleni Mandrali. Weighted LTL with dis- counting. In Proc. of CIIA'12, pages 353-360, 2012.","title":"Eleni Mandrali. Weighted LTL with discounting","authors":"Mandrali","year":"2012","venue":"Proc. of CIIA'12","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Montali et al., 2010] Marco Montali, Maja Pesic, Wil M. P. van der Aalst, Federico Chesani, Paola Mello, and Sergio Storari. Declarative specification and verification of ser- vice choreographiess. ACM Trans. on the Web, 4(1):3:1- 3:62, 2010.","title":"Declarative specification and verification of service choreographiess","authors":"Marco Montali, Maja Pesic, M P Wil, Federico Van Der Aalst, Paola Chesani, Sergio Mello, Storari","year":"2010","venue":"ACM Trans. on the Web","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Pnueli, 1977] Amir Pnueli. The Temporal Logic of Pro- grams. In Proc. of FOCS, pages 46-57, 1977.","title":"The Temporal Logic of Programs","authors":"Amir Pnueli, Pnueli","year":"1977","venue":"Proc. of FOCS","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[van der Aalst et al., 2009] W.M.P. van der Aalst, M. Pesic, and H. Schonenberg. Declarative Workflows: Balancing Between Flexibility and Support. Computer Science -Re- search and Development, 23(2):99-113, 2009.","title":"Declarative Workflows: Balancing Between Flexibility and Support","authors":"W M P Van Der Aalst, M Pesic, H Schonenberg","year":"2009","venue":"Computer Science -Research and Development","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Xiao et al., 2021] Shengping Xiao, Jianwen Li, Shufang Zhu, Yingying Shi, Geguang Pu, and Moshe Y. Vardi. On- the-fly synthesis for LTL over finite traces. In Proc. of AAAI, pages 6530-6537, 2021.","title":"Onthe-fly synthesis for LTL over finite traces","authors":"Shengping Xiao, Jianwen Li, Shufang Zhu, Yingying Shi, Geguang Pu, Moshe Y Vardi","year":"2021","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Zhu et al., 2020] Shufang Zhu, Giuseppe De Giacomo, Geguang Pu, and Moshe Y. Vardi. Ltlf synthesis with fairness and stability assumptions. In Proc. of AAAI, pages 3088-3095, 2020.","title":"Ltlf synthesis with fairness and stability assumptions","authors":"Shufang Zhu, Giuseppe De Giacomo, Geguang Pu, Moshe Y Vardi","year":"2020","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}