{"type":"ScholarlyArticle","title":"On Verifying Expectations and Observations of Intelligent Agents","authors":[{"name":"Sourav Chakraborty","slug":"sourav-chakraborty","given":"Sourav","family":"Chakraborty","affiliation":"Indian Statistical Institute , Kolkata"},{"name":"Avijeet Ghosh","slug":"avijeet-ghosh","given":"Avijeet","family":"Ghosh","affiliation":"Indian Statistical Institute , Kolkata"},{"name":"Sujata Ghosh","slug":"sujata-ghosh","given":"Sujata","family":"Ghosh","affiliation":"Indian Statistical Institute , Chennai"},{"name":"François Schwarzentruber","slug":"francois-schwarzentruber","given":"François","family":"Schwarzentruber","affiliation":"Univ Rennes , IRISA , France"}],"abstract":"Public observation logic (POL) is a variant of dynamic epistemic logic to reason about agent expectations and agent observations. Agents have certain expectations, regarding the situation at hand, that are actuated by the relevant protocols, and they eliminate possible worlds in which their expectations do not match with their observations.  In this work, we investigate the computational complexity of the model checking problem for POL and prove its PSPACE-completeness. We also study various syntactic fragments of POL. We exemplify the applicability of POL model checking in verifying different characteristics and features of an interactive system with respect to the distinct expectations and (matching) observations of the system. Finally, we provide a discussion on the implementation of the model checking algorithms.","doi":"10.24963/ijcai.2022/356","url":"https://ijcai.org/proceedings/2022/356","pdf":"https://ijcai.org/proceedings/2022/0356.pdf","markdown":"https://ijcai.org/proceedings/2022/356.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/356","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":356,"pages":{"first":2568,"last":2574},"keywords":["Knowledge Representation and Reasoning: Reasoning about Knowledge and Belief","Knowledge Representation and Reasoning: Reasoning about actions","Knowledge Representation and Reasoning: Computational Complexity of Reasoning"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38987099","length_sec":89,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38985242","length_sec":642,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Ågotnes et al., 2010] T Ågotnes, P Balbiani, H van Dit- marsch, and P Seban. Group announcement logic. J. Appl. Log., 8(1):62-81, 2010.","title":"Group announcement logic","authors":"Ågotnes, H Balbiani, Van Ditmarsch, Seban","year":"2010","venue":"J. Appl. Log","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alur et al., 2002] R Alur, T A Henzinger, and O Kupfer- man. Alternating-time temporal logic. JACM, 49(5):672- 713, 2002.","title":"Alternating-time temporal logic","authors":"T A Alur, Henzinger, Kupferman","year":"2002","venue":"JACM","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Aucher and Schwarzentruber, 2013] G Aucher and F Schwarzentruber. On the complexity of dynamic epistemic logic. TARK, 2013.","title":"On the complexity of dynamic epistemic logic","authors":"G Aucher, Schwarzentruber","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baier and Katoen, 2008] C Baier and J-P Katoen. Princi- ples of model checking. MIT Press, 2008.","title":"Principles of model checking","authors":"C Baier, J-P Katoen","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Balcázar et al., 1997] J L Balcázar, J Díaz, and R Gavaldà. Algorithms for learning finite automata from queries: A unified view. In Advances in Algorithms, Languages, and Complexity, pages 53-72, 1997.","title":"Algorithms for learning finite automata from queries: A unified view","authors":"J L Balcázar, J Díaz, Gavaldà","year":"1997","venue":"Advances in Algorithms, Languages, and Complexity","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Belardinelli et al., 2021] F Belardinelli, S Knight, A Lo- muscio, B Maubert, A Murano, and S Rubin. Reasoning about agents that may know other agents' strategies. In IJCAI, pages 1787-1793, 2021.","title":"Reasoning about agents that may know other agents' strategies","authors":"Belardinelli, Knight, B Lomuscio, Maubert, Murano, Rubin","year":"2021","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2021/246"},{"position":7,"raw":"[Ben-Ari, 2012] M Ben-Ari. Mathematical Logic for Com- puter Science, 3rd Edition. Springer, 2012.","title":"Mathematical Logic for Computer Science","authors":"M Ben-Ari","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bolander et al., 2020] T Bolander, T Charrier, S Pinchinat, and F Schwarzentruber. DEL-based epistemic planning: Decidability and complexity. Artif. Intell., 287:103304, 2020.","title":"DEL-based epistemic planning: Decidability and complexity","authors":"Bolander, S Charrier, Pinchinat, Schwarzentruber","year":"2020","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bonet et al., 2009] B Bonet, H Palacios, and H Geffner. Au- tomatic derivation of memoryless policies and finite-state controllers using classical planners. In ICAPS, 2009.","title":"Automatic derivation of memoryless policies and finite-state controllers using classical planners","authors":"H Bonet, H Palacios, Geffner","year":"2009","venue":"ICAPS","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bozzelli et al., 2017] Bozzelli, A Molinari, A Montanari, and A Peron. An in-depth investigation of interval tempo- ral logic model checking with regular expressions. SEFM, 10469:104-119, 2017.","title":"An in-depth investigation of interval temporal logic model checking with regular expressions","authors":"A Bozzelli, Molinari, Montanari, Peron","year":"2017","venue":"SEFM","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Chakraborty et al., 2022] S Chakraborty, A Ghosh, S Ghosh, and F Schwarzentruber. On verifying expec- tations and observations of intelligent agents. CoRR, abs/2205.00784, 2022.","title":"On verifying expectations and observations of intelligent agents","authors":"Chakraborty, S Ghosh, Ghosh, Schwarzentruber","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Charrier et al., 2019] T Charrier, S Pinchinat, and F Schwarzentruber. Symbolic model checking of public announcement protocols. JLC, 29(8):1211-1249, 2019.","title":"Symbolic model checking of public announcement protocols","authors":"Charrier, Pinchinat, Schwarzentruber","year":"2019","venue":"JLC","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Chatterjee et al., 2010] K Chatterjee, T A Henzinger, and N Piterman. Strategy logic. Inf. Comput., 208(6):677-693, 2010.","title":"Strategy logic","authors":"T A Chatterjee, Henzinger, Piterman","year":"2010","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[de Weerd et al., 2017] H de Weerd, R Verbrugge, and B Verheij. Negotiating with other minds: the role of re- cursive theory of mind in negotiation with incomplete in- formation. AAMAS, 31(2):250-287, 2017.","title":"Negotiating with other minds: the role of recursive theory of mind in negotiation with incomplete information","authors":"R De Weerd, Verbrugge, Verheij","year":"2017","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Fagin et al., 1995] R Fagin, J Y Halpern, Y Moses, and M Y Vardi. Reasoning about Knowledge. MIT Press, 1995.","title":"Reasoning about Knowledge","authors":"J Y Fagin, Y Halpern, M Y Moses, Vardi","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Fischer and Ladner, 1979] M J Fischer and R E Ladner. Propositional dynamic logic of regular programs. JCSS, 18(2):194-211, 1979.","title":"Propositional dynamic logic of regular programs","authors":"M J Fischer, R E Ladner","year":"1979","venue":"JCSS","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[French and van Ditmarsch, 2008] T French and H van Dit- marsch. Undecidability for arbitrary public announcement logic. In AiML, pages 23-42, 2008.","title":"T French and H van Ditmarsch. Undecidability for arbitrary public announcement logic","authors":"Van French, Ditmarsch","year":"2008","venue":"AiML","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Ghosh and Ramanujam, 2012] S Ghosh and R Ramanujam. Strategies in games: A logic-automata study. LNCS, 7388:110-159, 2012.","title":"Strategies in games: A logic-automata study","authors":"Ramanujam ; S Ghosh, R Ghosh, Ramanujam","year":"2012","venue":"LNCS","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Lomuscio and Michaliszyn, 2016] Alessio Lomuscio and Jakub Michaliszyn. Model checking multi-agent systems against epistemic HS specifications with regular expres- sions. KR, pages 298-308, 2016.","title":"Model checking multi-agent systems against epistemic HS specifications with regular expressions","authors":"Alessio Lomuscio, Jakub Michaliszyn","year":"2016","venue":"KR","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Lutz, 2006] C Lutz. Complexity and succinctness of public announcement logic. AAMAS, pages 137-143, 2006.","title":"Complexity and succinctness of public announcement logic","authors":"Lutz","year":"2006","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Muise et al., 2022] C Muise, V Belle, P Felli, S A McIl- raith, T Miller, A R Pearce, and L Sonenberg. Efficient multi-agent epistemic planning: Teaching planners about nested belief. Artificial Intelligence, 302, 2022.","title":"Efficient multi-agent epistemic planning: Teaching planners about nested belief","authors":"V Muise, P Belle, S A Felli, T Mcilraith, A R Miller, L Pearce, Sonenberg","year":"2022","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"J Plaza. Logics of public communications. Synthese, 158(2):165-179, 2007.","title":"Logics of public communications","authors":"Plaza","year":"2007","venue":"Synthese","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Saffidine et al., 2018] A Saffidine, F Schwarzentruber, and B Zanuttini. Knowledge-based policies for qualitative de- centralized pomdps. AAAI, pages 6270-6277, 2018.","title":"Knowledge-based policies for qualitative decentralized pomdps","authors":"Saffidine, Schwarzentruber, Zanuttini","year":"2018","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Savitch, 1970] W J Savitch. Relationships between non- deterministic and deterministic tape complexities. JCSS, 4(2):177-192, 1970.","title":"Relationships between nondeterministic and deterministic tape complexities","authors":"W J Savitch","year":"1970","venue":"JCSS","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Schnoebelen, 2002] P Schnoebelen. The complexity of tem- poral logic model checking. AiML, pages 393-436, 2002.","title":"The complexity of temporal logic model checking","authors":"Schnoebelen","year":"2002","venue":"AiML","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[van Benthem et al., 2006] J van Benthem, J van Eijck, and B P Kooi. Logics of communication and change. Informa- tion and Computation, 204(11):1620-1662, 2006.","title":"Logics of communication and change","authors":"Van Benthem","year":"2006","venue":"Information and Computation","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[van Benthem et al., 2018] J van Benthem, J van Eijck, M Gattinger, and K Su. Symbolic model checking for dy- namic epistemic logic -S5 and beyond. JLC, 28(2):367- 402, 2018.","title":"Symbolic model checking for dynamic epistemic logic -S5 and beyond","authors":"Van Benthem","year":"2018","venue":"JLC","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[van Benthem, 2011] J van Benthem. Logical dynamics of information and interaction. Cambridge University Press, 2011.","title":"Logical dynamics of information and interaction","authors":"; J Van Benthem, Van Benthem","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[van Ditmarsch et al., 2008] H van Ditmarsch, W van der Hoek, and B Kooi. Dynamic Epistemic Logic, volume 337 of Synthese Library. Springer, 2008.","title":"Dynamic Epistemic Logic","authors":"W Van Ditmarsch, Van Der Hoek, Kooi","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[van Ditmarsch et al., 2014] H van Ditmarsch, S Ghosh, R Verbrugge, and Y Wang. Hidden protocols: Modifying our expectations in an evolving world. Artificial Intelli- gence, 208:18-40, 2014.","title":"Hidden protocols: Modifying our expectations in an evolving world","authors":"S Van Ditmarsch, R Ghosh, Y Verbrugge, Wang","year":"2014","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Wang, 2011] Y Wang. Reasoning about protocol change and knowledge. ICLA, 6521:189-203, 2011.","title":"Reasoning about protocol change and knowledge","authors":"Wang","year":"2011","venue":"ICLA","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}