Most solutions to the technical frame problem in theories of actions depend on special axioms like the frame axioms, the law of inertia, or the successor state axioms. In these solutions facts about a situation are regarded and represented as properties which hold in the situation. In this article it is argued that it is often more adequate to view facts about a situation as resources which are...

We model belief change due to noisy sensing, and belief introspection in the framework of the situation calculus. We give some properties of our axiomatization and show that it does not suffer from the problems with combining sensing, introspection, and plausibility update described in Shapiro et al. [2000].

A method to recognize agent’s intentions is presented in a framework that combines the logic of Situation Calculus and Probability Theory. The method is restricted to contexts where the agent only performs procedures in a given library of procedures, and where the system that intends to recognize the agent’s intentions has a complete knowledge of the actions performed by the agent. An original ...

Initially, situation semantics was conceived as essentially synthetic, with a mathematical ontology built up on set theory. Soon after the appearance of [4], however, the authors changed their approach and decided to handle the topic in an analytic fashion, abstracting a mathematical ontology from analyses of natural language use. Situation theory is the name they gave to the underlying mathema...

In this paper we consider axiomatizing AI search algorithms in the situation calculus. Proper axiomatization of such algorithms is important for understanding control knowledge which is by deenition search algorithm dependent: a control knowledge can be eeective with respect to one search algorithm but ineffective with respect to another. The key idea here is to view search algorithms as strict...