{"type":"ScholarlyArticle","title":"First-Order Progression beyond Local-Effect and Normal Actions","authors":[{"name":"Daxin Liu","slug":"daxin-liu","given":"Daxin","family":"Liu","affiliation":"The University of Edinburgh"},{"name":"Jens Claßen","slug":"jens-cla-en","given":"Jens","family":"Claßen","affiliation":"Roskilde University"}],"abstract":"One of the fundamental problems in reasoning about action is progression, which is to update a knowledge base according to the effects of an action into another knowledge base that retains all proper information. The problem is notoriously challenging, as in general, it requires second-order logic. Efforts have been made to find fragments where progression is first-order definable. Liu and Lakemeyer showed that for actions that have only local effects, progression is always first-order definable. They also generalized the result to so-called normal actions, that allow for non-local effects, as long as the affected fluent predicates only depend on local-effect ones, under certain restrictions on the knowledge base. In addition, they showed that for so-called proper+ knowledge bases, progression for normal actions can be efficient under reasonable assumptions. In this paper, we consider a larger class of theories, called the acyclic ones, that strictly subsumes normal actions. In such theories, dependencies between non-local effect fluent predicates are allowed, as long as they do not contain any cycles. We prove progression to be equally first-order definable for this class. Furthermore, under similar but stronger assumptions than those made by Liu and Lakemeyer, we show that progression is efficient as well.","doi":"10.24963/ijcai.2024/385","url":"https://ijcai.org/proceedings/2024/385","pdf":"https://ijcai.org/proceedings/2024/0385.pdf","markdown":"https://ijcai.org/proceedings/2024/385.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/385","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":385,"pages":{"first":3475,"last":3483},"keywords":["Knowledge Representation and Reasoning: KRR: Reasoning about actions"],"videos":[],"references":[{"position":1,"raw":"[Ackermann, 1935] Wilhelm Ackermann. Untersuchungen über das Eliminationsproblem der mathematischen Logik. Mathematische Annalen, 110(1):390-413, 1935.","title":"Untersuchungen über das Eliminationsproblem der mathematischen Logik","authors":"Wilhelm Ackermann","year":"1935","venue":"Mathematische Annalen","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Belle and Lakemeyer, 2011] Vaishak Belle and Gerhard Lakemeyer. On progression and query evaluation in first- order knowledge bases with function symbols. In IJCAI, 2011.","title":"Vaishak Belle and Gerhard Lakemeyer. On progression and query evaluation in firstorder knowledge bases with function symbols","authors":"Belle, Lakemeyer","year":"2011","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Belle and Levesque, 2014] Vaishak Belle and Hector Levesque. How to progress beliefs in continuous domains. In KR, 2014.","title":"Vaishak Belle and Hector Levesque. How to progress beliefs in continuous domains","authors":"Belle, Levesque","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Belle and Levesque, 2020] Vaishak Belle and Hector J. Levesque. Regression and progression in stochastic do- mains. Artificial Intelligence, 281:103247, 2020.","title":"Vaishak Belle and Hector J. Levesque. Regression and progression in stochastic domains","authors":"Belle, Levesque","year":"2020","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Claßen and Delgrande, 2022] Jens Claßen and James P. Delgrande. Projection of belief in the presence of non- deterministic actions and fallible sensing. In KR, pages 400-404, 2022.","title":"Projection of belief in the presence of nondeterministic actions and fallible sensing","authors":"Delgrande Claßen, Jens Claßen, James P Delgrande","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Claßen and Zarrieß, 2017] Jens Claßen and Benjamin Zarrieß. Decidable verification of decision-theoretic Golog. In Proceedings of the Eleventh International Symposium on Frontiers of Combining Systems (FroCoS 2017), volume 10483 of LNCS, pages 227-243. Springer, 2017.","title":"Decidable verification of decision-theoretic Golog","authors":"Zarrieß Claßen, Jens Claßen, Benjamin Zarrieß","year":"2017","venue":"Proceedings of the Eleventh International Symposium on Frontiers of Combining Systems (FroCoS 2017)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Claßen, 2013] Jens Claßen. Planning and verification in the agent language Golog. PhD thesis, RWTH Aachen Uni- versity, 2013.","title":"Planning and verification in the agent language Golog","authors":"Jens Claßen, Claßen","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Conradie, 2006] Willem Conradie. On the strength and scope of DLS. Journal of Applied Non-Classical Logics, 16(3-4):279-296, 2006.","title":"On the strength and scope of DLS","authors":"Willem Conradie, Conradie","year":"2006","venue":"Journal of Applied Non-Classical Logics","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[De Giacomo et al., 2016] Giuseppe De Giacomo, Yves Lespérance, Fabio Patrizi, and Stavros Vassos. Progres- sion and verification of situation calculus agents with bounded beliefs. Studia Logica, 104:705-739, 2016.","title":"Progression and verification of situation calculus agents with bounded beliefs","authors":"Giuseppe De, Giacomo, Yves Lespérance, Fabio Patrizi, Stavros Vassos","year":"2016","venue":"Studia Logica","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Doherty et al., 1997] Patrick Doherty, Witold Łukaszewicz, and Andrzej Szałas. Computing circumscription revisited: A reduction algorithm. Journal of Automated Reasoning, 18:297-336, 1997.","title":"Computing circumscription revisited: A reduction algorithm","authors":"Patrick Doherty, Witold Łukaszewicz, Andrzej Szałas","year":"1997","venue":"Journal of Automated Reasoning","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Fang et al., 2019] Liangda Fang, Yongmei Liu, and Hans Van Ditmarsch. Forgetting in multi-agent modal logics. Artificial Intelligence, 266:51-80, 2019.","title":"Forgetting in multi-agent modal logics","authors":"Fang","year":"2019","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Fikes and Nilsson, 1971] Richard Fikes and Nils J. Nils- son. STRIPS: A new approach to the application of the- orem proving to problem solving. Artificial Intelligence, 2(3/4):189-208, 1971.","title":"STRIPS: A new approach to the application of theorem proving to problem solving","authors":"Richard Fikes, Nils J Nilsson","year":"1971","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/1971/63"},{"position":13,"raw":"[Gabbay et al., 2008] Dov M. Gabbay, Renate A. Schmidt, and Andrzej Szalas. Second-Order Quantifier Elimina- tion. Foundations, Computational Aspects and Applica- tions. College Publications, 2008.","title":"Second-Order Quantifier Elimination. Foundations, Computational Aspects and Applications","authors":"Dov M Gabbay, Renate A Schmidt, Andrzej Szalas","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Lakemeyer and Levesque, 2002] Gerhard Lakemeyer and Hector J. Levesque. Evaluation-based reasoning with dis- junctive information in first-order knowledge bases. In KR, pages 73-81, 2002.","title":"Evaluation-based reasoning with disjunctive information in first-order knowledge bases","authors":"Levesque Lakemeyer, Gerhard Lakemeyer, Hector J Levesque","year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Lakemeyer and Levesque, 2009] Gerhard Lakemeyer and Hector J. Levesque. A semantical account of progression in the presence of defaults. Conceptual Modeling: Foun- dations and Applications: Essays in Honor of John My- lopoulos, pages 82-98, 2009.","title":"A semantical account of progression in the presence of defaults","authors":"Levesque Lakemeyer, Gerhard Lakemeyer, Hector J Levesque","year":"2009","venue":"Conceptual Modeling: Foundations and Applications: Essays in Honor of John Mylopoulos","doi":null,"url":null,"internal_url":"/proceedings/2009/144"},{"position":16,"raw":"[Lin and Reiter, 1994] Fangzhen Lin and Ray Reiter. Forget it. In Working Notes of AAAI Fall Symposium on Rele- vance, pages 154-159, 1994.","title":"Fangzhen Lin and Ray Reiter. Forget it","authors":"Reiter Lin","year":"1994","venue":"Working Notes of AAAI Fall Symposium on Relevance","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lin and Reiter, 1997] Fangzhen Lin and Ray Reiter. How to progress a database. Artificial Intelligence, 92(1-2):131- 167, 1997.","title":"Fangzhen Lin and Ray Reiter. How to progress a database","authors":"Reiter Lin","year":"1997","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Liu and Feng, 2023] Daxin Liu and Qihui Feng. On the progression of belief. Artificial Intelligence, 322:103947, 2023.","title":"On the progression of belief","authors":"Feng Liu, Daxin Liu, Qihui Feng","year":"2023","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Liu and Lakemeyer, 2009] Yongmei Liu and Gerhard Lake- meyer. On first-order definability and computability of progression for local-effect actions and beyond. In IJCAI, pages 860-866, 2009.","title":"On first-order definability and computability of progression for local-effect actions and beyond","authors":"Yongmei Liu, Gerhard Lakemeyer","year":"2009","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2009/147"},{"position":20,"raw":"[Liu and Levesque, 2005] Yongmei Liu and Hector J. Levesque. Tractable reasoning in first-order knowledge bases with disjunctive information. In Proceedings of the National Conference on Artificial Intelligence, volume 20, page 639. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999, 2005.","title":"Tractable reasoning in first-order knowledge bases with disjunctive information","authors":"Yongmei Liu, Hector J Levesque","year":"1999","venue":"Proceedings of the National Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Liu et al., 2023] Daxin Liu, Qinfei Huang, Vaishak Belle, and Gerhard Lakemeyer. Verifying belief-based programs via symbolic dynamic programming. In ECAI 2023, pages 1497-1504. IOS Press, 2023.","title":"Verifying belief-based programs via symbolic dynamic programming","authors":"Daxin Liu, Qinfei Huang, Vaishak Belle, Gerhard Lakemeyer","year":"2023","venue":"ECAI 2023","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[McCarthy and Hayes, 1969] John McCarthy and Patrick Hayes. Some philosophical problems from the standpoint of artificial intelligence. In B. Meltzer and D. Michie, ed- itors, Machine Intelligence 4, pages 463-502. American Elsevier, New York, 1969.","title":"Some philosophical problems from the standpoint of artificial intelligence","authors":"Hayes ; Mccarthy, John Mccarthy, Patrick Hayes","year":"1969","venue":"Machine Intelligence","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Pednault, 1987] Edwin Peter Dawson Pednault. Toward a mathematical theory of plan synthesis. Stanford Univer- sity, 1987.","title":"Toward a mathematical theory of plan synthesis","authors":"Edwin Peter, Dawson Pednault","year":"1987","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Pednault, 1989] Edwin PD Pednault. ADL: exploring the middle ground between STRIPS and the situation calculus. In KR, pages 324-332, 1989.","title":"ADL: exploring the middle ground between STRIPS and the situation calculus","authors":"; Pednault, Edwin, Pednault","year":"1989","venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Reiter, 1991] Raymond Reiter. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. Artificial Intelli- gence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pages 359-380, 1991.","title":"The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression","authors":"Raymond Reiter","year":"1991","venue":"Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Reiter, 2001] Raymond Reiter. Knowledge in action: logi- cal foundations for specifying and implementing dynami- cal systems. MIT press, 2001.","title":"Knowledge in action: logical foundations for specifying and implementing dynamical systems","authors":"Raymond Reiter, Reiter","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Schwering et al., 2015] Christoph Schwering, Gerhard Lakemeyer, and Maurice Pagnucco. Belief revision and progression of knowledge bases in the epistemic situation calculus. In IJCAI, 2015.","title":"Belief revision and progression of knowledge bases in the epistemic situation calculus","authors":"Christoph Schwering, Gerhard Lakemeyer, Maurice Pagnucco","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/453"},{"position":28,"raw":"[van Ditmarsch et al., 2007] Hans P. van Ditmarsch, An- dreas Herzig, and Tiago de Lima. Optimal regression for reasoning about knowledge and actions. In AAAI, pages 1070-1076. AAAI Press, 2007.","title":"Optimal regression for reasoning about knowledge and actions","authors":"P Hans, Andreas Van Ditmarsch, Tiago Herzig, De Lima","year":"2007","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Vassos and Levesque, 2008] Stavros Vassos and Hector J. Levesque. On the progression of situation calculus basic action theories: Resolving a 10-year-old conjecture. In AAAI, pages 1004-1009, 2008.","title":"On the progression of situation calculus basic action theories: Resolving a 10-year-old conjecture","authors":"Levesque ; ] Vassos, Stavros Vassos, Hector J Levesque","year":"2008","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Vassos and Levesque, 2013] Stavros Vassos and Hector J. Levesque. How to progress a database III. Artificial In- telligence, 195:203-221, 2013.","title":"How to progress a database III","authors":"Levesque ; ] Vassos, Stavros Vassos, Hector J Levesque","year":"2013","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Vassos and Patrizi, 2013] Stavros Vassos and Fabio Patrizi. A classification of first-order progressable action theories in situation calculus. In IJCAI, pages 1132-1138, 2013.","title":"A classification of first-order progressable action theories in situation calculus","authors":"Patrizi Vassos, Stavros Vassos, Fabio Patrizi","year":"2013","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/171"},{"position":32,"raw":"[Vassos et al., 2008] Stavros Vassos, Gerhard Lakemeyer, and Hector J. Levesque. First-order strong progression for local-effect basic action theories. In KR, pages 662-672, 2008.","title":"First-order strong progression for local-effect basic action theories","authors":"Stavros Vassos, Gerhard Lakemeyer, Hector J Levesque","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Vassos et al., 2009] Stavros Vassos, Stavros Sardina, and Hector Levesque. Progressing basic action theories with non-local effect actions. In Ninth International Sympo- sium on Logical Formalizations of Commonsense Reason- ing, pages 135-140, 2009.","title":"Progressing basic action theories with non-local effect actions","authors":"Stavros Vassos, Stavros Sardina, Hector Levesque","year":"2009","venue":"Ninth International Symposium on Logical Formalizations of Commonsense Reasoning","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Zarrieß and Claßen, 2016] Benjamin Zarrieß and Jens Claßen. Decidable verification of Golog programs over non-local effect actions. In AAAI, 2016.","title":"Decidable verification of Golog programs over non-local effect actions","authors":"Claßen Zarrieß, Benjamin Zarrieß, Jens Claßen","year":"2016","venue":"AAAI","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}