{"type":"ScholarlyArticle","title":"On First-Order Definability and Computability of Progression for Local-Effect Actions and Beyond","authors":[{"name":"Yongmei Liu","slug":"yongmei-liu","given":"Yongmei","family":"Liu","affiliation":"Dept. of Computer Science Sun Yat-sen University Guangzhou 510275 , China"},{"name":"Gerhard Lakemeyer","slug":"gerhard-lakemeyer","given":"Gerhard","family":"Lakemeyer","affiliation":"Dept. of Computer Science RWTH Aachen 52056 Aachen , Germany"}],"abstract":"In a seminal paper, Lin and Reiter introduced the notion of progression for basic action theories in the situation calculus. Unfortunately, progression is not first-order definable in general. Recently, Vassos, Lakemeyer, and Levesque showed that in case actions have only local effects, progression is first-order representable. However, they could show computability of the first-order representation only for a restricted class. Also, their proofs were quite involved. In this paper, we present a result stronger than theirs that for local-effect actions, progression is always first-order definable and computable. We give a very simple proof for this via the concept of forgetting. We also show first-order definability and computability results for a class of knowledge bases and actions with non-local effects. Moreover, for a certain class of local-effect actions and knowledge bases for representing disjunctive information, we show that progression is not only first-order definable but also efficiently computable.Yongmei Liu, Gerhard Lakemeyer","doi":null,"url":"https://ijcai.org/proceedings/2009/147","pdf":"https://ijcai.org/proceedings/2009/0147.pdf","markdown":"https://ijcai.org/proceedings/2009/147.md","bibtex":"https://ijcai.org/proceedings/2009/bibtex/147","volume":{"slug":"2009","title":"Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2009","url":"https://ijcai.org/proceedings/2009/","year":2009,"location":"Pasadena, California, USA","dates":"","editors":"Hiroaki Kitano","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":147,"pages":{"first":860,"last":865},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Doherty et al., 2001] P. Doherty, W. Lukaszewicz, and A. Szalas. Computing strongest necessary and weak- est sufficient conditions of first-order formulas. In Proc. IJCAI-01, 2001.","title":"Computing strongest necessary and weakest sufficient conditions of first-order formulas","authors":"P Doherty, W Lukaszewicz, A Szalas","year":"2001","venue":"Proc. IJCAI-01","doi":null,"url":null,"internal_url":"/proceedings/2001/20"},{"position":2,"raw":"[Gelfond and Lifschitz, 1993] M. Gelfond and V. Lifschitz. Representing actions and change by logic programs. Jour- nal of Logic Programming, 17(2-4):301-323, 1993.","title":"Representing actions and change by logic programs","authors":"M Gelfond, V Lifschitz","year":"1993","venue":"Journal of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Lakemeyer and Levesque, 2002] G. Lakemeyer and H. J. Levesque. Evaluation-based reasoning with disjunctive in- formation in first-order knowledge bases. In Proc. KR, 2002.","title":"Evaluation-based reasoning with disjunctive information in first-order knowledge bases","authors":"G Lakemeyer, H J Levesque","year":"2002","venue":"Proc. KR","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Levesque et al., 1997] H. J. Levesque, R. Reiter, Y. Lespérance, F. Lin, and R. Scherl. Golog: A logic programming language for dynamic domains. J. of Logic Programming, 31:59-84, 1997.","title":"Golog: A logic programming language for dynamic domains","authors":"H J Levesque, R Reiter, Y Lespérance, F Lin, R Scherl","year":"1997","venue":"J. of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Levesque, 1998] H. J. Levesque. A completeness result for reasoning with incomplete first-order knowledge bases. In Proc. KR-98, 1998.","title":"A completeness result for reasoning with incomplete first-order knowledge bases","authors":"H J Levesque","year":"1998","venue":"Proc. KR-98","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Lin and Reiter, 1994] F. Lin and R. Reiter. Forget it! In Working Notes of AAAI Fall Symposium on Relevance, 1994.","title":"Forget it!","authors":"F Lin, R Reiter","year":"1994","venue":"Working Notes of AAAI Fall Symposium on Relevance","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Lin and Reiter, 1997] F. Lin and R. Reiter. How to progress a database. Artificial Intelligence, 92(1-2):131-167, 1997.","title":"How to progress a database","authors":"F Lin, R Reiter","year":"1997","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Liu and Levesque, 2005] Y. Liu and H. J. Levesque. Tractable reasoning in first-order knowledge bases with disjunctive information. In Proc. AAAI-05, 2005.","title":"Tractable reasoning in first-order knowledge bases with disjunctive information","authors":"Y Liu, H J Levesque","year":"2005","venue":"Proc. AAAI-05","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Liu et al., 2004] Y. Liu, G. Lakemeyer, and H. J. Levesque. A logic of limited belief for reasoning with disjunctive in- formation. In Proc. KR-04, 2004.","title":"A logic of limited belief for reasoning with disjunctive information","authors":"Y Liu, G Lakemeyer, H J Levesque","year":"2004","venue":"Proc. KR-04","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Nonnengart et al., 1999] A. Nonnengart, H. J. Ohlbach, and A. Szalas. Elimination of predicate quantifiers. In Logic, Language and Reasoning, Part I, pages 159-181. 1999.","title":"Elimination of predicate quantifiers","authors":"A Nonnengart, H J Ohlbach, A Szalas","year":"1999","venue":"Logic, Language and Reasoning, Part I","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Reiter, 2001] R. Reiter. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. 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},{"position":12,"raw":"[Vassos and Levesque, 2008] S. Vassos and H. J. Levesque. On the progression of situation calculus basic action theo- ries: Resolving a 10-year-old conjecture. In Proc. AAAI- 08, 2008.","title":"On the progression of situation calculus basic action theories: Resolving a 10-year-old conjecture","authors":"S Vassos, H J Levesque","year":"2008","venue":"Proc. AAAI-08","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Vassos et al., 2008] S. Vassos, G. Lakemeyer, and H. J. Levesque. First-order strong progression for local-effect basic action theories. In Proc. KR-08, 2008.","title":"First-order strong progression for local-effect basic action theories","authors":"S Vassos, G Lakemeyer, H J Levesque","year":"2008","venue":"Proc. KR-08","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}