From Predicate Calculus to the Situation Calculus

  • Chapter
  • First Online:
Toward Robots That Reason: Logic, Probability & Causal Laws
  • 127 Accesses

Abstract

Our account is formulated in the language of the situation calculus, the most established special-purpose knowledge representation formalism for reasoning about dynamical systems. Originally postulated by McCarthy, and later revised by Reiter, it is a dialect of first-order logic with distinguished sorts. So we begin with a brief recap of standard first-order and second-order logic, before turning to the situation calculus.

You can prove anything you want by coldly logical reason—if you pick the proper postulates.

– Isaac Asimov, I, Robot

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 32.09
Price includes VAT (Germany)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 42.79
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info
Hardcover Book
EUR 42.79
Price includes VAT (Germany)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Proofs are omitted almost entirely in this book. The bibliographic sections at the end of every chapter detail where formal statements (and their proofs by extension) can be found.

  2. 2.

    Regression is a form of query rewriting [231], and can be seen as the sentential solution to pre-image computation for state-based abstractions seen in model checking [46].

  3. 3.

    Since their work, a number of other special cases have been studied [160].

  4. 4.

    There are numerous nonmonotonic accounts that rely on a controlled extension to predicates—often referred to as model minimization—to overcome the need to specify every qualifier and condition, e.g., [3, 87].

  5. 5.

    This can be contrasted to a model checking approach, where the application of interest is captured directly as a propositional, first-order or modal structure [107, 227].

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vaishak Belle .

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Belle, V. (2023). From Predicate Calculus to the Situation Calculus. In: Toward Robots That Reason: Logic, Probability & Causal Laws. Synthesis Lectures on Artificial Intelligence and Machine Learning. Springer, Cham. https://doi.org/10.1007/978-3-031-21003-7_3

Download citation

Publish with us

Policies and ethics

Navigation