Proving properties of states in the situation calculus
β Scribed by Raymond Reiter
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 653 KB
- Volume
- 64
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
β¦ Synopsis
Reiter, R., Proving properties of states in the situation calculus (Research Note), Artificial Intelligence 64 (1993) 337-351.
In the situation calculus, it is sometimes necessary to prove that certain properties are true in all world states accessible from the initial state. This is the case for some forms of reasoning about the physical world, for certain planning applications, and for verifying integrity constraints in databases. Not surprisingly, this requires a suitable form of mathematical induction. This paper motivates the need for proving properties of states in the situation calculus, proposes appropriate induction principles for this task, and gives examples of their use in databases and for reasoning about the physical world.
π SIMILAR VOLUMES
Baker, A.B., Nonmonotonic reasoning in the framework of situation calculus, Artificial Intelligence 49 (1991) 5-23. Most of the solutions proposed to the Yale shooting problem have either introduced new nonmonotonic reasoning methods (generally involving temporal priorities) or completely reformula
Successor state axioms provide a solution to the famous Frame Problem as far as the representational aspect is concerned. Solving in classical, monotonic logic the additional inferential Frame Problem, on the other hand, was the major motivation for the development of the Fluent Calculus a decade or