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...

Dyna is an AI architecture that integrates learning, planning, and reactive execution. Learning methods are used in Dyna both for compiling planning results and for updating a model of the eeects of the agent's actions on the world. Planning is incre-mental and can use the probabilistic and ofttimes incorrect world models generated by learning processes. Execution is fully reactive in the sense...

In a seminal paper Lin and Reiter introduced the notion of progression for basic action theories in the situation calculus. The idea is to replace an initial database by a new set of sentences which reflect the changes due to an action. Unfortunately, progression requires secondorder logic in general. In this paper, we introduce the notion of strong progression, a slight variant of Lin and Reit...

A fundamental task in reasoning about action and change is projection, which refers to determining what holds after a number of actions have occurred. A powerful method for solving the projection problem is regression, which reduces reasoning about the future to reasoning about the initial state. In particular, regression has played an important role in the situation calculus and its epistemic ...

We define a notion of bounded action theory in the situation calculus, where the theory entails that in all situations, the number of ground fluent atoms is bounded by a constant. Such theories can still have an infinite domain and an infinite set of states. We argue that such theories are fairly common in applications, either because facts do not persist indefinitely or because one eventually ...