{"type":"ScholarlyArticle","title":"Synthesizing strategies under expected and exceptional environment behaviors","authors":[{"name":"Benjamin Aminof","slug":"benjamin-aminof","given":"Benjamin","family":"Aminof","affiliation":"TU Vienna , Austria,"},{"name":"Giuseppe De Giacomo","slug":"giuseppe-de-giacomo","given":"Giuseppe","family":"De Giacomo","affiliation":"University of Rome \"La Sapienza\" , Italy,"},{"name":"Alessio Lomuscio","slug":"alessio-lomuscio","given":"Alessio","family":"Lomuscio","affiliation":"Imperial College London , UK,"},{"name":"Aniello Murano","slug":"aniello-murano","given":"Aniello","family":"Murano","affiliation":"University of Naples \"Federico II\" , Italy,"},{"name":"Sasha Rubin","slug":"sasha-rubin","given":"Sasha","family":"Rubin","affiliation":"University of Sydney , Australia"}],"abstract":"We consider an agent that operates with two models of the environment: one that captures expected behaviors and one that captures additional exceptional behaviors. We study the problem of synthesizing agent strategies that enforce a goal against environments operating as expected while also making a best effort against exceptional environment behaviors. We formalize these concepts in the context of linear-temporal logic, and give an algorithm for solving this problem. We also show that there is no trade-off between enforcing the goal under the expected environment specification and making a best-effort for it under the exceptional one.","doi":"10.24963/ijcai.2020/232","url":"https://ijcai.org/proceedings/2020/232","pdf":"https://ijcai.org/proceedings/2020/0232.pdf","markdown":"https://ijcai.org/proceedings/2020/232.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/232","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":232,"pages":{"first":1674,"last":1680},"keywords":["Agent-based and Multi-agent Systems: Formal Verification, Validation and Synthesis","Knowledge Representation and Reasoning: Action, Change and Causality","Planning and Scheduling: Theoretical Foundations of Planning"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/25184/file_25184.m3u8","length_sec":272,"provider":"hls"}],"references":[{"position":1,"raw":"[Aminof et al., 2018] B. Aminof, G. De Giacomo, A. Mu- rano, and S. Rubin. Synthesis under assumptions. In KR, 2018.","title":"Synthesis under assumptions","authors":"B Aminof, G De Giacomo, A Murano, S Rubin","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Aminof et al., 2019a] B. Aminof, G. De Giacomo, A. Mu- rano, and S. Rubin. Planning under LTL environment specifications. In ICAPS, 2019.","title":"Planning under LTL environment specifications","authors":"Aminof","year":"2019","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Aminof et al., 2019b] B. Aminof, M. Kwiatkowska, B. Maubert, A. Murano, and S. Rubin. Probabilistic strategy logic. In IJCAI, 2019.","title":"Probabilistic strategy logic","authors":"Aminof","year":"2019","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/5"},{"position":4,"raw":"[Aminof et al., 2020] B. Aminof, G. De Giacomo, and S. Rubin. Stochastic fairness and language-theoretic fair- ness in planning on nondeterministic domains. In ICAPS, 2020.","title":"Stochastic fairness and language-theoretic fairness in planning on nondeterministic domains","authors":"B Aminof, G De Giacomo, S Rubin","year":"2020","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"K.R Apt and E. Grädel. Lectures in game theory for computer scientists. Cambridge, 2011.","title":"Lectures in game theory for computer scientists","authors":"K Apt, E Grädel","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bacchus and Kabanza, 1996] F. Bacchus and F. Kabanza. Planning for temporally extended goals. In AAAI, 1996.","title":"Planning for temporally extended goals","authors":"F Bacchus, F Kabanza","year":"1996","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bacchus and Kabanza, 2000] F. Bacchus and F. Kabanza. Using temporal logics to express search control knowledge for planning. Artif. Intell., 116(1-2), 2000.","title":"Using temporal logics to express search control knowledge for planning","authors":"F Bacchus, F Kabanza","year":"2000","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Belardinelli et al., 2017] F. Belardinelli, A. Lomuscio, A. Murano, and S. Rubin. Verification of broadcasting multi- agent systems against an epistemic strategy logic. In IJ- CAI, 2017.","title":"Verification of broadcasting multiagent systems against an epistemic strategy logic","authors":"F Belardinelli, A Lomuscio, A Murano, S Rubin","year":"2017","venue":"IJ-CAI","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Belle, 2018] V. Belle. On plans with loops and noise. In AAMAS, 2018.","title":"On plans with loops and noise","authors":"V Belle","year":"2018","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Berthon et al., 2017] R. Berthon, B. Maubert, A. Murano, S. Rubin, and M.Y. Vardi. Strategy logic with imperfect information. In LICS, 2017.","title":"Strategy logic with imperfect information","authors":"R Berthon, B Maubert, A Murano, S Rubin, M Y Vardi","year":"2017","venue":"LICS","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Berwanger, 2007] D. Berwanger. Admissibility in infinite games. In STACS, 2007.","title":"Admissibility in infinite games","authors":"D Berwanger","year":"2007","venue":"STACS","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Bloem et al., 2015] R. Bloem, R. Ehlers, and R. Könighofer. Cooperative reactive synthesis. In ATVA, 2015.","title":"Cooperative reactive synthesis","authors":"R Bloem, R Ehlers, R Könighofer","year":"2015","venue":"ATVA","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Bonet et al., 2017] B. Bonet, G. De Giacomo, H. Geffner, and S. Rubin. Generalized planning: Non-deterministic abstractions and trajectory constraints. In IJCAI, 2017.","title":"Generalized planning: Non-deterministic abstractions and trajectory constraints","authors":"B Bonet, G De Giacomo, H Geffner, S Rubin","year":"2017","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/121"},{"position":14,"raw":"[Bozzano and Villafiorita, 2007] M. Bozzano and A. Vil- lafiorita. The FSAP/NuSMV-SA safety analysis platform. Software Tools for Technology Transfer, 9(1), 2007.","title":"The FSAP/NuSMV-SA safety analysis platform","authors":"M Bozzano, A Villafiorita","year":"2007","venue":"Software Tools for Technology Transfer","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Brenguier et al., 2017] R. Brenguier, J. Raskin, and O. Sankur. Assume-admissible synthesis. Acta Inf., 54(1), 2017.","title":"Assume-admissible synthesis","authors":"R Brenguier, J Raskin, O Sankur","year":"2017","venue":"Acta Inf","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Bruyère et al., 2017] V. Bruyère, E. Filiot, M. Randour, and J.F. Raskin. Meet your expectations with guarantees: Be- yond worst-case synthesis in quantitative games. Inf. Com- put., 254:259-295, 2017.","title":"Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games","authors":"V Bruyère, E Filiot, M Randour, J F Raskin","year":"2017","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Camacho et al., 2018] A. Camacho, M. Bienvenu, and S. McIlraith. Finite LTL synthesis with environment assump- tions and quality measures. In KR, 2018.","title":"Finite LTL synthesis with environment assumptions and quality measures","authors":"A Camacho, M Bienvenu, S Mcilraith","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Camacho et al., 2019] A. Camacho, R. Toro Icarte, T. Klassen, R. Valenzano, and S. McIlraith. LTL and be- yond: Formal languages for reward function specification in reinforcement learning. In IJCAI, 2019.","title":"LTL and beyond: Formal languages for reward function specification in reinforcement learning","authors":"A Camacho, R Toro Icarte, T Klassen, R Valenzano, S Mcilraith","year":"2019","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/840"},{"position":19,"raw":"[Chakraborti et al., 2019] T. Chakraborti, A. Kulkarni, S. Sreedharan, D. Smith, and S. Kambhampati. Explicabil- ity? Legibility? Predictability? Transparency? Privacy? Security? The emerging landscape of interpretable agent behavior. In ICAPS, 2019.","title":"Explicability? Legibility? Predictability? Transparency? Privacy? Security? The emerging landscape of interpretable agent behavior","authors":"T Chakraborti, A Kulkarni, S Sreedharan, D Smith, S Kambhampati","year":"2019","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Chatterjee and Henzinger, 2007] K. Chatterjee and T. Hen- zinger. Assume-guarantee synthesis. In TACAS, 2007.","title":"Assume-guarantee synthesis","authors":"Chatterjee, ] K Henzinger, T Chatterjee, Henzinger","year":"2007","venue":"TACAS","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Daniele et al., 1999] M. Daniele, P. Traverso, and M. Vardi. Strong cyclic planning revisited. In ECP, 1999.","title":"Strong cyclic planning revisited","authors":"M Daniele, P Traverso, M Vardi","year":"1999","venue":"ECP","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[De Giacomo and Rubin, 2018] G. De Giacomo and S. Ru- bin. Automata-theoretic foundations of FOND planning for LTLf and LDLf goals. In IJCAI, 2018.","title":"Automata-theoretic foundations of FOND planning for LTLf and LDLf goals","authors":"De Giacomo, ; ] G Rubin, Giacomo De, S Rubin","year":"2018","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/657"},{"position":23,"raw":"[De Giacomo and Vardi, 1999] G. De Giacomo and M. Vardi. Automata-theoretic approach to planning for tem- porally extended goals. In ECP, 1999.","title":"Automata-theoretic approach to planning for temporally extended goals","authors":"De Giacomo, ; Vardi, G De, Giacomo, M Vardi","year":"1999","venue":"ECP","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[De Giacomo et al., 2013] G. De Giacomo, F. Patrizi, and S. Sardiña. Automatic behavior composition synthesis. Artif. Intell., 196, 2013.","title":"Automatic behavior composition synthesis","authors":"G De Giacomo, F Patrizi, S Sardiña","year":"2013","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[De Giacomo et al., 2019] G. De Giacomo, L. Iocchi, M. Fa- vorito, and F. Patrizi. Foundations for restraining bolts: Reinforcement learning with LTLf/LDLf restraining spec- ifications. In ICAPS, 2019.","title":"Foundations for restraining bolts: Reinforcement learning with LTLf/LDLf restraining specifications","authors":"G De Giacomo, L Iocchi, M Favorito, F Patrizi","year":"2019","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[D'Ippolito et al., 2018] N. D'Ippolito, N. Rodríguez, and S. Sardiña. Fully observable non-deterministic planning as assumption-based reactive synthesis. J. Artif. Intell. Res., 61, 2018.","title":"Fully observable non-deterministic planning as assumption-based reactive synthesis","authors":"N Ippolito, N Rodríguez, S Sardiña","year":"2018","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Ezekiel and Lomuscio, 2017] J. Ezekiel and A. Lomuscio. Combining fault injection and model checking to verify fault tolerance, recoverability, and diagnosability in multi- agent systems. Inf. Comput., 254(2):167-194, 2017.","title":"Combining fault injection and model checking to verify fault tolerance, recoverability, and diagnosability in multiagent systems","authors":"J Ezekiel, A Lomuscio","year":"2017","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Ezekiel et al., 2011] J. Ezekiel, A. Lomuscio, L. Mol- nar, and S. Veres. Verifying fault tolerance and self- diagnosability of an autonomous underwater vehicle. In IJCAI, 2011.","title":"Verifying fault tolerance and selfdiagnosability of an autonomous underwater vehicle","authors":"J Ezekiel, A Lomuscio, L Molnar, S Veres","year":"2011","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Faella, 2009] M. Faella. Admissible strategies in infinite games over graphs. In MFCS, 2009.","title":"Admissible strategies in infinite games over graphs","authors":"M Faella","year":"2009","venue":"MFCS","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Finkbeiner, 2016] B. Finkbeiner. Synthesis of reactive sys- tems. Dependable Software Systems Eng., 45, 2016.","title":"Synthesis of reactive systems","authors":"B Finkbeiner","year":"2016","venue":"Dependable Software Systems Eng","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Geffner and Bonet, 2013] H. Geffner and B. Bonet. A Co- incise Introduction to Models and Methods for Automated Planning. Morgan & Claypool, 2013.","title":"A Coincise Introduction to Models and Methods for Automated Planning","authors":"H Geffner, B Bonet","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Grädel et al., 2002] E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research, LNCS 2500, 2002.","title":"Automata, Logics, and Infinite Games: A Guide to Current Research","authors":null,"year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Maubert and Murano, 2018] B. Maubert and A. Murano. Reasoning about knowledge and strategies under hierar- chical information. In KR, 2018.","title":"Reasoning about knowledge and strategies under hierarchical information","authors":"B Maubert, A Murano","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Mogavero et al., 2014] F. Mogavero, A. Murano, G. Perelli, and M.Y. Vardi. Reasoning about strategies: On the model-checking problem. ACM Trans. Comput. Log., 15(4):34:1-34:47, 2014.","title":"Reasoning about strategies: On the model-checking problem","authors":"F Mogavero, A Murano, G Perelli, M Y Vardi","year":"2014","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Pnueli and Rosner, 1989] A. Pnueli and R. Rosner. On the synthesis of a reactive module. In POPL, 1989.","title":"On the synthesis of a reactive module","authors":"Rosner Pnueli, ] A Pnueli, R Rosner","year":"1989","venue":"POPL","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Reiter, 2001] R. Reiter. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press, 2001.","title":"Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems","authors":"R Reiter","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}