Abstract:
Abstract. We explore the situation calculus within the framework of inductive definability. A consequence of this view of the situation calculus is to establish direct connections with different variants of the-calculus [Park, 1970; Hitchcock and Park, 1973; Pratt, 1981; Kozen, 1983; Emerson and Clarke, 1980], structural operational semantics of concurrent processes [Plotkin, 1981], and logic programming [Apt, 1990]. First we show that the induction principle on situations [Reiter, 1993] is implied by an inductive definition of the set of situations. Then we consider the frame problem from the point of view of inductive definability and by defining fluents inductively we obtain essentially the same form of successor state axioms as [Reiter, 1991]. Our approach allows extending this result to the case where ramification constraints are present. Finally we demonstrate a method of applying inductive definitions for computing fixed point properties of GOLOG programs. 1
Citations
|
2762
|
Communication and Concurrency
– Milner
- 1989
|
|
1064
|
A Structural Approach to Operational Semantics
– Plotkin
- 1981
|
|
909
|
Temporal and modal logic
– Emerson
- 1990
|
|
523
|
The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression
– Reiter
- 1991
|
|
401
|
Golog: A logic programming language for dynamic domains
– Levesque, Reiter, et al.
- 1997
|
|
387
|
Logic programming
– Apt
- 1990
|
|
190
|
Results on the propositional mu-calculus
– Kozen
- 1983
|
|
154
|
Embracing causality in specifying the indirect effects of actions
– Lin
- 1995
|
|
140
|
Elementary induction on abstract structures
– Moschovakis
- 1974
|
|
135
|
An Introduction to Inductive Definitions
– Aczel
- 1977
|
|
133
|
Ramification and causality
– Thielscher
- 1997
|
|
106
|
Proving properties of states in the situation calculus
– Reiter
- 1993
|
|
92
|
Process Algebra, volume 18 of Cambridge Tracts
– Baeten, Weijland
- 1990
|
|
91
|
A Practical Theory of Programming
– Hehner
- 1993
|
|
85
|
Characterizing correctness properties of parallel programs using fixpoints, International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 85
– Emerson, Clarke
- 1980
|
|
83
|
Inductive Definitions, Semantics and Abstract Interpretation
– Cousot, Cousot
- 1992
|
|
77
|
Reasoning about concurrent execution, prioritized interrupts, and exogenous actions in the situation calculus
– Giacomo, Lespérance, et al.
- 1997
|
|
42
|
A Course
– Bell, Machover
- 1977
|
|
34
|
Fixpoint Induction and Proofs of Program Properties
– Park
- 1969
|
|
24
|
Induction rules and termination proofs
– Hitchcock, Park
- 1969
|
|
19
|
Representing Actions and State Constraints in Model-Based Diagnosis
– McIlraith
- 1997
|
|
12
|
Higher order logic
– Leivant
- 1994
|
|
6
|
Nonterminating processes in the situation calculus
– Giacomo, Ternovskaia, et al.
- 1997
|
|
1
|
A decidable -calculus (preliminary rept
– Pratt
- 1981
|
|
