Situation Calculus

A Situation Calculus is a logic formalism that ...

• See: Logic Programming, Logic, John McCarthy (Computer Scientist), Ray Reiter.

---

---

References

2017

• (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/Situation_calculus Retrieved:2017-6-6.
  • The situation calculus is a logic formalism designed for representing and reasoning about dynamical domains. It was first introduced by John McCarthy in 1963. The main version of the situational calculus that is presented in this article is based on that introduced by Ray Reiter in 1991. It is followed by sections about McCarthy's 1986 version and a logic programming formulation.

2017

• (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/Situation_calculus#Overview Retrieved:2017-6-6.
  • The situation calculus represents changing scenarios as a set of first-order logic formulae. The basic elements of the calculus are:
    • The actions that can be performed in the world
    • The fluents that describe the state of the world
    • The situations
  • A domain is formalized by a number of formulae, namely:
    • Action precondition axioms, one for each action
    • Successor state axioms, one for each fluent
    • Axioms describing the world in various situations
    • The foundational axioms of the situation calculus
  • A simple robot world will be modeled as a running example. In this world there is a single robot and several inanimate objects. The world is laid out according to a grid so that locations can be specified in terms of [math]\displaystyle{ (x,y) }[/math] coordinate points. It is possible for the robot to move around the world, and to pick up and drop items. Some items may be too heavy for the robot to pick up, or fragile so that they break when they are dropped. The robot also has the ability to repair any broken items that it is holding.

1991

• (Reiter, 1991) ⇒ Raymond Reiter. (1991). “The Frame Problem in Situation the Calculus: A Simple Solution (sometimes) and a Completeness Result for Goal Regression.” In: Artificial intelligence and mathematical theory of computation. ISBN:0-12-450010-2

---