{"type":"ScholarlyArticle","title":"Automatic Verification of FSA Strategies via Counterexample-Guided Local Search for Invariants","authors":[{"name":"Kailun Luo","slug":"kailun-luo","given":"Kailun","family":"Luo","affiliation":"Dept. of Computer Science , Sun Yat-sen University , Guangzhou 510006 , China"},{"name":"Yongmei Liu","slug":"yongmei-liu","given":"Yongmei","family":"Liu","affiliation":"Dept. of Computer Science , Sun Yat-sen University , Guangzhou 510006 , China"}],"abstract":"Strategy representation and reasoning has received much attention over the past years. In this paper, we consider the representation of general strategies that solve a class of (possibly infinitely many) games with similar structures, and their automatic verification, which is an undecidable problem. We propose to represent a general strategy by an FSA (Finite State Automaton) with edges labelled by restricted Golog programs. We formalize the semantics of FSA strategies in the situation calculus. Then we propose an incomplete method for verifying whether an FSA strategy is a winning strategy by counterexample-guided local search for appropriate invariants. We implemented our method and did experiments on combinatorial game and also single-agent domains. Experimental results showed that our system can successfully verify most of them within a reasonable amount of time.","doi":"10.24963/ijcai.2019/251","url":"https://ijcai.org/proceedings/2019/251","pdf":"https://ijcai.org/proceedings/2019/0251.pdf","markdown":"https://ijcai.org/proceedings/2019/251.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/251","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":251,"pages":{"first":1814,"last":1821},"keywords":["Knowledge Representation and Reasoning: Automated Reasoning and Theorem Proving","Knowledge Representation and Reasoning: Action, Change and Causality"],"videos":[],"references":[{"position":1,"raw":"[Alur et al., 2002] Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. Alternating-time temporal logic. J. ACM, 49(5):672-713, 2002.","title":"Alternating-time temporal logic","authors":"Rajeev Alur, Thomas A Henzinger, Orna Kupferman","year":"2002","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Cermák et al., 2014] Petr Cermák, Alessio Lomuscio, Fabio Mogavero, and Aniello Murano. MCMAS-SLK: A model checker for the verification of strategy logic specifications. In Computer Aided Verification -26th International Con- ference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18-22, 2014. Pro- ceedings, pages 525-532, 2014.","title":"MCMAS-SLK: A model checker for the verification of strategy logic specifications","authors":"Cermák","year":"2014","venue":"Computer Aided Verification -26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Chatterjee et al., 2010] Krishnendu Chatterjee, Thomas A. Henzinger, and Nir Piterman. Strategy logic. Inf. Comput., 208(6):677-693, 2010.","title":"Strategy logic","authors":"Krishnendu Chatterjee, Thomas A Henzinger, Nir Piterman","year":"2010","venue":"Inf. Comput","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Clarke et al., 2000] Edmund M. Clarke, Orna Grum- berg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-guided abstraction refinement. In Computer Aided Verification, 12th International Confer- ence, CAV 2000, Chicago, IL, USA, July 15-19, 2000, Proceedings, 2000.","title":"Counterexample-guided abstraction refinement","authors":"Edmund M Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, Helmut Veith","year":"2000","venue":"Computer Aided Verification, 12th International Conference, CAV 2000","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Clarke et al., 2003] Edmund M. Clarke, Orna Grum- berg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-guided abstraction refinement for symbolic model checking. J. ACM, 50(5):752-794, 2003.","title":"Counterexample-guided abstraction refinement for symbolic model checking","authors":"Edmund M Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, Helmut Veith","year":"2003","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Claßen and Lakemeyer, 2008] Jens Claßen and Gerhard Lakemeyer. A logic for non-terminating golog programs. In Principles of Knowledge Representation and Reason- ing: Proceedings of the Eleventh International Confer- ence, KR 2008, Sydney, Australia, September 16-19, 2008, pages 589-599, 2008.","title":"A logic for non-terminating golog programs","authors":"Lakemeyer Claßen, Jens Claßen, Gerhard Lakemeyer","year":"2008","venue":"Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, KR 2008","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[De Giacomo et al., 2010] Giuseppe De Giacomo, Yves Lespérance, and Adrian R. Pearce. Situation calculus based programs for representing and reasoning about game structures. In Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Con- ference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010, 2010.","title":"Situation calculus based programs for representing and reasoning about game structures","authors":"Giuseppe De, Giacomo, Yves Lespérance, Adrian R Pearce","year":"2010","venue":"Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[De Giacomo et al., 2016a] Giuseppe De Giacomo, Yves Lespérance, and Fabio Patrizi. Bounded situation calcu- lus action theories. Artif. Intell., 237:172-203, 2016.","title":"Bounded situation calculus action theories","authors":"Giacomo De","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[De Giacomo et al., 2016b] Giuseppe De Giacomo, Yves Lespérance, Fabio Patrizi, and Sebastian Sardiña. Verify- ing congolog programs on bounded situation calculus the- ories. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA., pages 950-956, 2016.","title":"Verifying congolog programs on bounded situation calculus theories","authors":"Giacomo De","year":"2016","venue":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[de Moura and Bjørner, 2008] Leonardo Mendonc ¸a de Moura and Nikolaj Bjørner. Z3: an efficient SMT solver. In Proceedings of the 14th International Confer- ence on Tools and Algorithms for the Construction and Analysis of Systems (TACAS-2008), pages 337-340, 2008.","title":"Leonardo Mendonc ¸a de Moura and Nikolaj Bjørner. Z3: an efficient SMT solver","authors":"De Moura, Bjørner","year":"2008","venue":"Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS-2008)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Ferguson, 2014] Thomas Ferguson. Game Theory. Mathe- matics Department, UCLA, 2014.","title":"Game Theory","authors":"Thomas Ferguson","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Genesereth et al., 2005] Michael R. Genesereth, Nathaniel Love, and Barney Pell. General game playing: Overview of the AAAI competition. AI Magazine, 26(2):62-72, 2005.","title":"General game playing: Overview of the AAAI competition","authors":"R Michael, Nathaniel Genesereth, Barney Love, Pell","year":"2005","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Hu and Levesque, 2011] Yuxiao Hu and Hector J. Levesque. A correctness result for reasoning about one-dimensional planning problems. In IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pages 2638-2643, 2011.","title":"A correctness result for reasoning about one-dimensional planning problems","authors":"Levesque Hu, Yuxiao Hu, Hector J Levesque","year":"2011","venue":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2011/439"},{"position":14,"raw":"[Levesque et al., 1997] Hector J. Levesque, Raymond Re- iter, Yves Lespérance, Fangzhen Lin, and Richard B. Scherl. GOLOG: A logic programming language for dy- namic domains. J. Log. Program., 31(1-3):59-83, 1997.","title":"GOLOG: A logic programming language for dynamic domains","authors":"Hector J Levesque, Raymond Reiter, Yves Lespérance, Fangzhen Lin, Richard B Scherl","year":"1997","venue":"J. Log. Program","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Levesque, 2005] Hector J. Levesque. Planning with loops. In IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30 -August 5, 2005, pages 509-515, 2005.","title":"Planning with loops","authors":"Hector J Levesque","year":"2005","venue":"IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Li and Liu, 2015] Naiqi Li and Yongmei Liu. Automatic verification of partial correctness of golog programs. In Proc. of IJCAI-15, pages 3113-3119, 2015.","title":"Automatic verification of partial correctness of golog programs","authors":"Li, Liu, Naiqi Li, Yongmei Liu","year":"2015","venue":"Proc. of IJCAI-15","doi":null,"url":null,"internal_url":"/proceedings/2015/439"},{"position":17,"raw":"[Lomuscio et al., 2009] Alessio Lomuscio, Hongyang Qu, and Franco Raimondi. MCMAS: A model checker for the verification of multi-agent systems. In Computer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 -July 2, 2009. Proceedings, pages 682-688, 2009.","title":"MCMAS: A model checker for the verification of multi-agent systems","authors":"Alessio Lomuscio, Hongyang Qu, Franco Raimondi","year":"2009","venue":"Computer Aided Verification, 21st International Conference, CAV 2009","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Mo et al., 2016] Peiming Mo, Naiqi Li, and Yongmei Liu. Automatic verification of golog programs via predicate ab- straction. In Proc. of the European Conference on Artifi- cial Intelligence (ECAI-2016), 2016.","title":"Automatic verification of golog programs via predicate abstraction","authors":"Mo","year":"2016","venue":"Proc. of the European Conference on Artificial Intelligence (ECAI-2016)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Ramanujam and Simon, 2008] Ramaswamy Ramanujam and Sunil Easaw Simon. Dynamic logic on games with structured strategies. In Principles of Knowledge Rep- resentation and Reasoning: Proceedings of the Eleventh International Conference, KR 2008, Sydney, Australia, September 16-19, 2008, pages 49-58, 2008.","title":"Dynamic logic on games with structured strategies","authors":"Ramaswamy Ramanujam, Sunil Easaw, Simon","year":"2008","venue":"Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, KR 2008","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Reiter, 2001] Raymond Reiter. Knowledge in Action: Logi- cal Foundations for Specifying and Implementing Dynam- ical Systems. MIT Press, 2001.","title":"Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems","authors":"Raymond Reiter","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Srivastava et al., 2008] Siddharth Srivastava, Neil Immer- man, and Shlomo Zilberstein. Learning generalized plans using abstract counting. In Proceedings of the Twenty- Third AAAI Conference on Artificial Intelligence, AAAI 2008, pages 991-997, 2008.","title":"Learning generalized plans using abstract counting","authors":"Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein","year":"2008","venue":"Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Xiong and Liu, 2016] Liping Xiong and Yongmei Liu. Strategy representation and reasoning in the situation cal- culus. In ECAI 2016 -22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands -Including Prestigious Applica- tions of Artificial Intelligence (PAIS 2016), pages 982- 990, 2016.","title":"Strategy representation and reasoning in the situation calculus","authors":"Liu ; ] Liping Xiong, Yongmei Xiong, Liu","year":"2016","venue":"The Netherlands -Including Prestigious Applications of Artificial Intelligence (PAIS 2016)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Zhang and Thielscher, 2015] Dongmo Zhang and Michael Thielscher. A logic for reasoning about game strategies. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA., pages 1671-1677, 2015.","title":"Dongmo Zhang and Michael Thielscher. A logic for reasoning about game strategies","authors":"Thielscher Zhang","year":"2015","venue":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}