How to progress a database II: the STRIPS connection

Authors:
Fangzhen Lin;Ray Reiter
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Canada;Department of Computer Science, University of Toronto, Toronto, Canada
Venue:
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Year:
1995

Citing 5
Cited 4

Toward a mathematical theory of plan synthesis

Toward a mathematical theory of plan synthesis
ADL: exploring the middle ground between STRIPS and the situation calculus

Proceedings of the first international conference on Principles of knowledge representation and reasoning
The frame problem in situation the calculus: a simple solution (sometimes) and a completeness result for goal regression

Artificial intelligence and mathematical theory of computation
Proving properties of states in the situation calculus

Artificial Intelligence
Downward refinement and the efficiency of hierarchical problem solving

Artificial Intelligence

SCDBR: An Automated Reasoner for Specifications of Database Updates

Journal of Intelligent Information Systems
What is planning in the presence of sensing?

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
First-order logical filtering

Artificial Intelligence
How to progress a database III

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ever since STRIPS was first introduced (Fikes and Nilsson [3]), its logical semantics has been problematic. There have been many proposals in the literature (e.g. Lifschitz [4], Erol, Nau and Subrahmanian [2], Bacchus and Yang [1]). These all have in common a reliance on metatheoretic operations on logical theories to capture the add and delete lists of STRIPS operators, but it has never been clear exactly what these operations correspond to declaratively, especially when they are applied to logically incomplete theories. In this paper we provide a semantics for STRIPS-like systems in terms of a purely declarative situation calculus axiomatization for actions and their effects. On our view, STRIPS is a mechanism for computing the progression (Lin and Reiter [6], Pednault [8]) of an initial situation calculus database under the effects of an action. We illustrate this idea by describing two different STRIPS mechanisms, and proving their correctness with respect to their situation calculus specifications.