## Proving Properties of States in the Situation Calculus (1993)

Venue: | Artificial Intelligence |

Citations: | 107 - 14 self |

### BibTeX

@ARTICLE{Reiter93provingproperties,

author = {Raymond Reiter},

title = {Proving Properties of States in the Situation Calculus},

journal = {Artificial Intelligence},

year = {1993},

volume = {64},

pages = {337--351}

}

### Years of Citing Articles

### OpenURL

### Abstract

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. Abbreviated title: Proving Properties of States 1 Introduction The situation calculus [8] is enjoying new popularity these days. One reason is that its expressiveness is considerably richer than has been commonly believed (Gelfond, Lifschitz and Rabinov [2], Pinto and Reiter [10], Schubert [16]). Another is the possibility of precisely characterizing the strengths and limi...

### Citations

1484 | Some philosophical problems from the standpoint of artificial intelligence
- McCarthy, Hayes
- 1969
(Show Context)
Citation Context ... P oss(drop(st; c); s) oe :enrolled(st; c; do(drop(st; c); s)): P oss(change(st; c; g); s) oe grade(st; c; g; do(change(st; c; g); s)): As is well known in the planning literature (McCarthy and Hayes =-=[9]-=-), the above axioms are not sufficient to correctly specify all database futures; frame axioms, specifying those relations left invariant by each transaction, must also be provided. We defer proposing... |

554 |
The frame problem in situation the calculus: a simple solution (sometimes) and a completeness result for goal regression
- Reiter
- 1991
(Show Context)
Citation Context ...er is the possibility of precisely characterizing the strengths and limitations of various general theories of actions expressed within its formalism (see Lin and Shoham [7], Lifschitz [5] and Reiter =-=[12]-=- for examples). Still another concerns its application in formalizing update transactions in database theory (Reiter [12, 15]). Within the situation calculus, it is sometimes necessary to prove that c... |

225 | State constraints revisited
- Lin, Reiter
- 1994
(Show Context)
Citation Context ...he context of the ramification problem (Finger [1], Lin and Shoham [7]), have exactly the same character as database integrity constraints, and can be given an identical treatment. See Lin and Reiter =-=[6]-=- for details. Within the database community, the notion of integrity constraints as inductive entailments has been proposed, and implemented, by Sheard and Stemple [17] in the context of relational da... |

216 |
Towards a logical reconstruction of relational database theory
- Reiter
- 1984
(Show Context)
Citation Context ...ity Constraints in Database Theory In the theory of databases, an integrity constraint specifies what counts as a legal database state; it is a property that every database state must satisfy (Reiter =-=[11]-=-). For example, ffl Salaries are functional: No one may have two different salaries in the same database state. ffl No one's salary may decrease during the evolution of the database. The concept of an... |

201 |
Situations, actions and causal laws
- McCarthy
- 1963
(Show Context)
Citation Context ...nciples for this task, and gives examples of their use in databases and for reasoning about the physical world. Abbreviated title: Proving Properties of States 1 1 Introduction The situation calculus =-=[8]-=- is enjoying new popularity these days. One reason is that its expressiveness is considerably richer than has been commonly believed (Gelfond, Lifschitz and Rabinov [2], Pinto and Reiter [10], Schuber... |

143 | Monotonic solution of the frame problem in the situation calculus: an efficient method for worlds with fully specified actions
- Schubert
- 1990
(Show Context)
Citation Context ...s enjoying new popularity these days. One reason is that its expressiveness is considerably richer than has been commonly believed (Gelfond, Lifschitz and Rabinov [2], Pinto and Reiter [10], Schubert =-=[16]-=-). Another is the possibility of precisely characterizing the strengths and limitations of various general theories of actions expressed within its formalism (see Lin and Shoham [7], Lifschitz [5] and... |

81 |
What are the Limitations of the Situation Calculus
- GELFOND, LIFSCHITZ, et al.
- 1991
(Show Context)
Citation Context ...oduction The situation calculus [8] is enjoying new popularity these days. One reason is that its expressiveness is considerably richer than has been commonly believed (Gelfond, Lifschitz and Rabinov =-=[2]-=-, Pinto and Reiter [10], Schubert [16]). Another is the possibility of precisely characterizing the strengths and limitations of various general theories of actions expressed within its formalism (see... |

78 |
Theorem proving by resolution as a basis for question-answering systems
- Green
- 1969
(Show Context)
Citation Context ...paper is how an agent might derive such facts from some background situation calculus axiomatization. 2.2 Planning The standard logical account of planning views this as a theorem proving task (Green =-=[3]-=-): To obtain a plan whose execution will lead to a world state s in which the goal G(s) will be true, establish that Axioms j= (9s):S 0sssG(s): Sometimes we would like to establish that no plan could ... |

77 | On specifying database updates
- Reiter
- 1992
(Show Context)
Citation Context ...ransactions, e.g. ffl Change a person's salary to $. ffl Register a student in a course. We shall assume that such transactions provide the only mechanism for database state changes. Following Reiter =-=[14, 15]-=-, we propose that databases be represented in the situation calculus; updatable relations will be fluents, i.e. they will take a state argument. Moreover, update transactions will be treated exactly l... |

73 |
The case for domain-specific frame axioms
- Haas
- 1987
(Show Context)
Citation Context ...e as frame axioms. One such approach, which we favour for the purposes of this paper, appeals to so-called explanation closure axioms as defined by Schubert [16], in elaborating on a proposal of Haas =-=[4]-=-. To illustrate the Haas-Schubert proposal, consider the transaction of registering a student in a course with multiple sections, without specifying in which section the student is placed. Denote the ... |

65 |
Exploiting constraints in design synthesis
- Finger
- 1986
(Show Context)
Citation Context ...base satisfies an integrity constraint IC iff the database entails the constraint: Database j= IC: 3 As it happens, state constraints, as they arise in the context of the ramification problem (Finger =-=[1]-=-, Lin and Shoham [7]), have exactly the same character as database integrity constraints, and can be given an identical treatment. See Lin and Reiter [6] for details. Within the database community, th... |

60 |
What Should a Database Know
- Reiter
- 1992
(Show Context)
Citation Context ...his axiomatization, our objective is to prove properties of all states accessible (via some finite sequence of possible actions) from S 0 , 3 This definition should be contrasted with those in Reiter =-=[11, 13]-=-. It seems that there is not a unitary concept of integrity constraint in database theory, and that there are many subtleties involved. 7 for example, sentences like (1), (2) and (3). Notice that thes... |

58 |
Automatic verification of database transaction safety
- Sheard, Stemple
- 1989
(Show Context)
Citation Context ...al treatment. See Lin and Reiter [6] for details. Within the database community, the notion of integrity constraints as inductive entailments has been proposed, and implemented, by Sheard and Stemple =-=[17]-=- in the context of relational databases. 2.4 Summary There are at least three reasons for wanting to prove properties of states in the situation calculus, one having to do with reasoning about the phy... |

46 | Provably correct theories of action
- Lin, Shoham
- 1995
(Show Context)
Citation Context ...er [10], Schubert [16]). Another is the possibility of precisely characterizing the strengths and limitations of various general theories of actions expressed within its formalism (see Lin and Shoham =-=[7]-=-, Lifschitz [5] and Reiter [12] for examples). Still another concerns its application in formalizing update transactions in database theory (Reiter [12, 15]). Within the situation calculus, it is some... |

38 | Toward a metatheory of action
- Lifschitz
- 1991
(Show Context)
Citation Context ...rt [16]). Another is the possibility of precisely characterizing the strengths and limitations of various general theories of actions expressed within its formalism (see Lin and Shoham [7], Lifschitz =-=[5]-=- and Reiter [12] for examples). Still another concerns its application in formalizing update transactions in database theory (Reiter [12, 15]). Within the situation calculus, it is sometimes necessary... |

27 | On Formalizing Database Updates: Preliminary Report
- Reiter
- 1992
(Show Context)
Citation Context ...pressed within its formalism (see Lin and Shoham [7], Lifschitz [5] and Reiter [12] for examples). Still another concerns its application in formalizing update transactions in database theory (Reiter =-=[12, 15]-=-). Within 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 in reasoning about the phy... |

15 |
Adding a Time Line to the Situation Calculus
- PINTO, REITER
- 1993
(Show Context)
Citation Context ... calculus [8] is enjoying new popularity these days. One reason is that its expressiveness is considerably richer than has been commonly believed (Gelfond, Lifschitz and Rabinov [2], Pinto and Reiter =-=[10]-=-, Schubert [16]). Another is the possibility of precisely characterizing the strengths and limitations of various general theories of actions expressed within its formalism (see Lin and Shoham [7], Li... |