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

Authors:
Francesco Savelli
Affiliations:
Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Via Salaria 113, I-00198 Roma, Italy
Venue:
Artificial Intelligence
Year:
2006

Citing 3
Cited 2

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
Some contributions to the metatheory of the situation calculus

Journal of the ACM (JACM)
Knowlege in action: logical foundations for specifying and implementing dynamical systems

Knowlege in action: logical foundations for specifying and implementing dynamical systems

A declarative agent programming language based on action theories

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Property persistence in the situation calculus

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a seminal paper, Reiter introduced a variant of the situation calculus along with a set of its properties. To the best of our knowledge, one of these properties has remained unproved and ignored despite its relevance to the planning problem and the expressivity of the theories of actions. We state this property in a more general form and provide its proof. Intuitively, whenever a theory of actions entails that there exists a situation satisfying a first order formula (e.g., a goal), at least one such situation must be found within a predetermined distance from the initial situation. This distance is finite and the same in all the models of the theory, since it depends only on the theory and the formula at hand.