Abstract
The situation calculus [8] is a methodology for expressing facts about action and change in formal languages of mathematical logic. It involves expressions for situations and actions (events), and the function Result that relates them to each other. The possibilities and limitations of this methodology have never been systematically investigated, and some of the commonly accepted views on this subject seem to be inaccurate.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
James Allen (1984): Towards a General Theory of Action and Time. Artificial Intelligence 23, 123–154.
Steve Hanks and Drew McDermott (1987): Nonmonotonic Logic and Temporal Projection. Artificial Intelligence 33(3), 379–412.
Robert Kowalski and Marek Sergot (1986): A Logic-based Calculus of Events. New Generation Computing 4, 67–95.
Vladimir Lifschitz (1987): Formal Theories of Action (preliminary report). Proc. IJCAI-87, 966–972.
Vladimir Lifschitz and Arkady Rabinov (1989): Miracles in Formal Theories of Actions. Artificial Intelligence 38(2), 225–237.
John McCarthy (1977): Epistemological Problems of Artificial Intelligence. Proc. IJCAI-77, 1038–1044.
John McCarthy (1986): Applications of Circumscription to Formalizing Common Sense Knowledge. Artificial Intelligence 26(3), 89–116.
John McCarthy and Patrick Hayes (1969): Some Philosophical Problems from the Standpoint of Artificial Intelligence. In: B. Meltzer and D. Michie, eds.: Machine Intelligence 4. 463–502. Edinburgh: Edinburgh University Press.
Edwin Pednault (1987): Formulating Multi-agent, Dynamic World Problems in the Classical Planning Framework. In: Michael Georgeff and Amy Lansky, eds.: Reasoning about Actions and Plans. 47–82. San Mateo, CA: Morgan Kaufmann.
Edwin Pednault (1988): Extending Conventional Planning Techniques to Handle Actions with Context-dependent Effects. Proc. AAAI-88, 55–59.
Len Schubert (1990): Monotonic Solution of the Frame Problem in the Situation Calculus: an Efficient Method for Worlds with Fully Specified Actions. In: H.E. Kyberg, R.P. Loui, and G.N. Carlson, eds.: Knowledge Representation and Defeasible Reasoning. Boston: Kluwer Academic Press. 23–67.
Yoav Shoham and Nita Goyal (1988): Temporal Reasoning in AI. In: Howard Shrobe, ed.: Exporing Artificial Intelligence. San Mateo, CA: Morgan Kaufmann.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Gelfond, M., Lifschitz, V., Rabinov, A. (1991). What Are the Limitations of the Situation Calculus?. In: Boyer, R.S. (eds) Automated Reasoning. Automated Reasoning Series, vol 1. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3488-0_8
Download citation
DOI: https://doi.org/10.1007/978-94-011-3488-0_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5542-0
Online ISBN: 978-94-011-3488-0
eBook Packages: Springer Book Archive