Skip to main content
SpringerLink
Log in

What Are the Limitations of the Situation Calculus?

  • Chapter
Automated Reasoning

Part of the book series: Automated Reasoning Series ((ARSE,volume 1))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. James Allen (1984): Towards a General Theory of Action and Time. Artificial Intelligence 23, 123–154.

    Article  MATH  Google Scholar 

  2. Steve Hanks and Drew McDermott (1987): Nonmonotonic Logic and Temporal Projection. Artificial Intelligence 33(3), 379–412.

    MATH  Google Scholar 

  3. Robert Kowalski and Marek Sergot (1986): A Logic-based Calculus of Events. New Generation Computing 4, 67–95.

    Article  Google Scholar 

  4. Vladimir Lifschitz (1987): Formal Theories of Action (preliminary report). Proc. IJCAI-87, 966–972.

    Google Scholar 

  5. Vladimir Lifschitz and Arkady Rabinov (1989): Miracles in Formal Theories of Actions. Artificial Intelligence 38(2), 225–237.

    Article  MATH  MathSciNet  Google Scholar 

  6. John McCarthy (1977): Epistemological Problems of Artificial Intelligence. Proc. IJCAI-77, 1038–1044.

    Google Scholar 

  7. John McCarthy (1986): Applications of Circumscription to Formalizing Common Sense Knowledge. Artificial Intelligence 26(3), 89–116.

    Article  Google Scholar 

  8. 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.

    Google Scholar 

  9. 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.

    Google Scholar 

  10. Edwin Pednault (1988): Extending Conventional Planning Techniques to Handle Actions with Context-dependent Effects. Proc. AAAI-88, 55–59.

    Google Scholar 

  11. 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.

    Chapter  Google Scholar 

  12. Yoav Shoham and Nita Goyal (1988): Temporal Reasoning in AI. In: Howard Shrobe, ed.: Exporing Artificial Intelligence. San Mateo, CA: Morgan Kaufmann.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas at El Paso, El Paso, Texas, USA

    M. Gelfond

  2. Department of Computer Sciences and Department of Philosophy, University of Texas at Austin, Austin, Texas, USA

    V. Lifschitz

  3. Apple Computer, Inc., Cupertino, California, USA

    A. Rabinov

Authors
  1. M. Gelfond
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Lifschitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Rabinov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Sciences Department, University of Texas at Austin, USA

    Robert S. Boyer

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation