# Some contributions to the metatheory of the situation calculus

@article{Pirri1999SomeCT, title={Some contributions to the metatheory of the situation calculus}, author={F. Pirri and Raymond Reiter}, journal={J. ACM}, year={1999}, volume={46}, pages={325-361} }

We focus on a rich axiomatization for actions in the situation calculus that includes, among other features, a solution to the frame problem for deterministic actions. Our work is foundational in nature, directed at simplifying the entailment problem for these axioms. Specifically, we make four contributions to the metatheory of situation calculus axiomatizations of dynamical systems:
(1) We prove that the above-mentioned axiomatization for actions has a relative satisfiability property; the… Expand

#### Topics from this paper

#### 217 Citations

Towards an Expressive Decidable Logical Action Theory

- Computer Science
- Description Logics
- 2012

This work considers a fragment P of the situation calculus and Reiter’s basic action theories such that the projection problem can be reduced to the satisfiability problem in an expressive description logic ALCO(U) that includes nominals (O), the universal role (U), and constructs from the well-known logic A LC. Expand

Towards an Expressive Practical Logical Action Theory

- Computer Science
- Turing-100
- 2012

This work considers a fragment P of the situation calculus and Reiter’s basic action theories such that the projection problem can be reduced to the satisfiability problem in an expressive description logic ALCO(U) that includes nominals (O), the universal role (U), and constructs from the well-known logic A LC. Expand

A description logic based situation calculus

- Mathematics, Computer Science
- Annals of Mathematics and Artificial Intelligence
- 2010

It is shown that the regression operator in this modified version of the situation calculus built using a two-variable fragment of the first-order logic extended with counting quantifiers can be defined similarly to regression in Reiter’s version ofThe situation calculus. Expand

A unifying action calculus

- Mathematics, Computer Science
- Artif. Intell.
- 2011

A unifying action calculus, which encompasses (well-defined classes of) all of the aforementioned formalisms, and provides a general, calculus-independent solution to a problem of practical relevance, which is intimately related to McCarthy's quest for elaboration tolerant formalisms: the modularity of domain axiomatizations. Expand

Inductive situation calculus

- Computer Science, Mathematics
- Artif. Intell.
- 2004

This paper develops an inductive variant of the situation calculus using the Logic for Non-Monotone Inductive Definitions (NMID), and shows that the basic version of the inductive situation calculus without ramification rules is equivalent to Reiter-style situation calculus. Expand

Property Persistence in the Situation Calculus

- Computer Science
- IJCAI
- 2007

An algorithm for reducing universally quantified situation calculus queries to a form more amenable to automated reasoning is developed, including checking for goal impossibility and reasoning about knowledge with partial observability of actions. Expand

Existential assertions and quantum levels on the tree of the situation calculus

- Mathematics, Computer Science
- Artif. Intell.
- 2006

This work state this property of the situation calculus in a more general form and provides its proof. Expand

A Feasible Approach to Disjunctive Knowledge in Situation Calculus

- Mathematics
- 2005

A Feasible Approach to Disjunctive Knowledge in Situation Calculus Stavros Vassos Master of Science Graduate Department of Computer Science University of Toronto 2005 In this thesis we present LP , a… Expand

Decidability Results for the Propositional Fluent Calculus

- Computer Science
- Computational Logic
- 2000

It is proved that even in this small fragment of the fluent calculus the entailment problem for a fairly restricted class of formulas is undecidable, and decidability of aclass of formulas which has interesting applications in resource planning is shown. Expand

ID-logic and the Ramification Problem for the Situation Calculus

- Computer Science
- ECAI
- 2000

The goal of this paper is to extend the general solution to the ramification problem for the situation calculus to the case where causal rules specifying indirect effects of actions may form cycles… Expand

#### References

SHOWING 1-10 OF 41 REFERENCES

Temporal reasoning in the situation calculus

- Mathematics
- 1994

A fundamental problem in Knowledge Representation is the design of a logical language to express theories about actions and change. One of the most prominent proposals for such a language is John… Expand

Default Reasoning, Nonmonotonic Logics, and the Frame Problem

- Computer Science, Mathematics
- AAAI
- 1986

This work provides axioms for a simple problem in temporal reasoning which has long been identified as a case of default reasoning, thus presumably amenable to representation in nonmonotonic logic, and investigates the failure of the logics considered and discusses two recent proposals for solving this problem. Expand

Proving Properties of States in the Situation Calculus

- Mathematics, Computer Science
- Artif. Intell.
- 1993

The need for proving properties of states in the situation calculus is motivated, appropriate induction principles for this task are proposed, and examples of their use in databases and for reasoning about the physical world are given. Expand

On Specifying Database Updates

- Computer Science
- J. Log. Program.
- 1995

This paper addresses the problem of formalizing the evolution of a database under the effect of an arbitrary sequence of update transactions by appealing to a first-order representation language called the situation calculus, and develops a database version of the frame problem in artificial intelligence. Expand

Occurrences and Narratives as Constraints in the Branching Structure of the Situation Calculus

- Mathematics, Computer Science
- J. Log. Comput.
- 1998

This paper argues that this new approach to dealing with action occurrences and narratives subsumes the linear approaches of Miller and Shanahan's, and Pinto and Reiter’s, and is able to represent various kinds of occurrences; namely, conditional, preventable and non-preventable occurrences. Expand

Toward a Metatheory of Action

- Computer Science
- KR
- 1991

A formalization of the blocks world on the basis of the situation calculus and circumscription is presented, and the main theorem describes the result which solves the frame problem in the presence of ramiications. Expand

Non-Monotonic Logic I

- Mathematics, Computer Science
- Artif. Intell.
- 1980

A model and proof theories, a proof procedure, and applications for one non-monotonic logic are developed, and it is proved the completeness of the non-Monotonic predicate calculus and the decidability of theNon- monotonic sentential calculus. Expand

Natural Actions, Concurrency and Continuous Time in the Situation Calculus

- Computer Science
- KR
- 1996

This paper shows how to gracefully accommodate all features within the situation calculus, without sacri-cing the simple solution to the frame problem of Reiter 25]. Expand

Solving the frame problem - a mathematical investigation of the common sense law of inertia

- Mathematics, Computer Science
- 1997

Why is the frame problem? describing the non-effects of actions introducing the situation calculus frame axioms towards a solution making frame axioms more compact criteria for a solution to the… Expand

The Case for Domain-Specific Frame Axioms

- Mathematics
- 1987

Abstract Several researchers have used non-monotonic logic in attempts to abolish frame axioms that are specific to one domain in favor of a universal frame axiom. We argue that the universal frame… Expand