Abstract
We present a CLP-based approach to reasoning about actions in the presence of incomplete states. Constraints expressing negative and disjunctive state knowledge are processed by a set of special Constraint Handling Rules. In turn, these rules reduce to standard finite domain constraints when handling variable arguments of single state components. Correctness of the approach is proved against the general action theory of the Fluent Calculus. The constraint solver is used as the kernel of a high-level programming language for agents that reason and plan. Experiments have shown that the constraint solver exhibits excellent computational behavior and scales up well.
Parts of the work reported in this paper have been carried out while the author was a visiting researcher at the University of New South Wales in Sydney, Australia.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wolfgang Bibel. A deductive solution for plan generation. New Generation Computing, 4:115–132, 1986.
Thom Frühwirth. Theory and practice of constraint handling rules. Journal of Logic Programming, 37(1–3):95–138, 1998.
Steffen Hölldobler and Josef Schneeberger. A new deductive approach to planning. New Generation Computing, 8:225–244, 1990.
Robert Kowalski and M. Sergot. A logic based calculus of events. New Generation Computing, 4:67–95, 1986.
Yves Lespérance, Hector J. Levesque, Fangzhen Lin, D. Marcu, Ray Reiter, and Richard B. Scherl. A logical approach to high-level robot programming—a progress report. In B. Kuipers, editor, Control of the Physical World by Intelligent Agents, Papers from the AAAI Fall Symposium, pages 109–119, New Orleans, LA, November 1994.
Hector J. Levesque, Raymond Reiter, Yves Lespérance, Fangzhen Lin, and Richard B. Scherl. GOLOG: A logic programming language for dynamic domains. Journal of Logic Programming, 31(1–3):59–83, 1997.
John McCarthy. Situations and Actions and Causal Laws. Stanford Artificial Intelligence Project, Memo 2, Stanford University, CA, 1963.
Raymond Reiter. Logic in Action. MIT Press, 2001.
Murray Shanahan. Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. MIT Press, 1997.
Murray Shanahan and Mark Witkowski. High-level robot control through logic. In C. Castelfranchi and Y. Lespérance, editors, Proceedings of the International Workshop on Agent Theories Architectures and Languages (ATAL), volume 1986 of LNCS, pages 104–121, Boston, MA, July 2000. Springer.
Michael Thielscher. From Situation Calculus to Fluent Calculus: State update axioms as a solution to the inferential frame problem. Artificial Intelligence, 111(1–2):277–299, 1999.
Michael Thielscher. Programming of reasoning and planning agents with FLUX. In D. Fensel, D. McGuinness, and M.-A. Williams, editors, Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 435–446, Toulouse, France, April 2002. Morgan Kaufmann.
Michael Thielscher. Pushing the envelope: Programming reasoning agents. In Chitta Baral and Sheila McIlraith, editors, AAAI Workshop on Cognitive Robotics, Edmonton, Canada, July 2002. AAAI Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thielscher, M. (2002). Reasoning about Actions with CHRs and Finite Domain Constraints. In: Stuckey, P.J. (eds) Logic Programming. ICLP 2002. Lecture Notes in Computer Science, vol 2401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45619-8_6
Download citation
DOI: https://doi.org/10.1007/3-540-45619-8_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43930-1
Online ISBN: 978-3-540-45619-3
eBook Packages: Springer Book Archive