Abstract
Successor state axioms are an optimal solution to the famous Frame Problem in reasoning about actions—but only as far as its representational aspect is concerned. We show how by gradually applying the principle of reification to these axioms, one can achieve gradual improvement regarding the inferential aspect without losing the representational merits. The resulting concept of state update axioms constitutes a novel version of what is known as the Fluent Calculus. We illustrate that under the provision that actions have no so-called open e_ects, any Situation Calculus specification can be transformed into an essentially equivalent Fluent Calculus specification, in which at the same time the representational and the inferential aspect of the Frame Problem are addressed. This alternative access to the Fluent Calculus both clarifies its role in relation to the most popular axiomatization paradigm and should help to enhance its acceptance.
on leave from Darmstadt University of Technology
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
W. Bibel. A deductive solution for plan generation. New Generation Computing, 4:115–132, 1986.
W. Bibel. Let’s plan it deductively! In M. Pollack, editor, Proceedings of IJCAI, pages 1549–1562, Nagoya, Japan, August 1997. Also to appear in Artif. Intell.
S.-E. Bornscheuer and M. Thielscher. Explicit and implicit indeterminism: Reasoning about uncertain and contradictory specifications of dynamic systems. J. of Logic Programming, 31(1–3):119–155, 1997.
R. E. Fikes and N. J. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artif. Intell., 2:189–208, 1971.
G. Große, S. Hölldobler, and J. Schneeberger. Linear Deductive Planning. J. of Logic and Computation, 6(2):233–262, 1996.
A. R. Haas. The case for domain-specific frame axioms. In F. M. Brown, editor, The Frame Problem in Artificial Intelligence, pages 343–348, Los Altos, CA, 1987.
S. Hölldobler and J. Schneeberger. A new deductive approach to planning. New Generation Computing, 8:225–244, 1990.
S. Hölldobler and M. Thielscher. Computing change and specificity with equational logic programs. Annals of Mathematics and Artif. Intell., 14(1):99–133, 1995.
H. Khalil. Formalizing the effects of actions in first order logic. Master’s thesis, Dept. of Computer Science, Darmstadt University of Technology, 1996.
R. Kowalski. Logic for Problem Solving. Elsevier, 1979.
M. Masseron, C. Tollu, and J. Vauzielles. Generating plans in linear logic I. Actions as proofs. J. of Theoretical Computer Science, 113:349–370, 1993.
J. McCarthy and P. J. Hayes. Some philosophical problems from the standpoint of artificial intelligence. Machine Intell., 4:463–502, 1969.
R. Reiter. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. In V. Lifschitz, editor, Artificial Intelligence and Mathematical Theory of Computation, pages 359–380, 1991.
M. Thielscher. Ramification and causality. Artif. Intell., 89(1–2):317–364, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thielscher, M. (1998). Towards State Update Axioms: Reifying Successor State Axioms. In: Dix, J., del Cerro, L.F., Furbach, U. (eds) Logics in Artificial Intelligence. JELIA 1998. Lecture Notes in Computer Science(), vol 1489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49545-2_17
Download citation
DOI: https://doi.org/10.1007/3-540-49545-2_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65141-3
Online ISBN: 978-3-540-49545-1
eBook Packages: Springer Book Archive