In many tasks related to reasoning about consequences of a logical theory, it is desirable to decompose the theory into a number of components with weakly-related or independent signatures. This facilitates reasoning when the signature of a query formula belongs to only one of the components. However, an initial theory may be subject to change due to execution of actions affecting features ment...

In this paper we consider updates that are specified as rules and consider simple knowledge bases consisting of ground atoms. We present a translation of the rule based update specifications to extended logic programs using situation calculus notation so as to compute the updated knowledge base. We show that the updated knowledge base that we compute satisfies the update specifications and yet ...

Location estimation is a fundamental sensing task in robotic applications, where the world is uncertain, and sensors and effectors are noisy. Most systems make various assumptions about the dependencies between state variables, and especially about how these dependencies change as a result of actions. Building on a general framework by Bacchus, Halpern and Levesque for reasoning about degrees o...

We propose a model of belief and intention change over the course of a dialogue, in the case where the decisions taken during the dialogue affect the possibly conflicting goals of the agents involved. We use Situation Calculus to model the evolution of the world and an observation model to analyze the evolution of intentions and beliefs. In our formalization, utterances, that only change the be...

The situation calculus (SC) is a formalism for reasoning about action. Within SC, the notion of state of a given situation is usually characterized by the set of uents that hold in that situation. However, this concept is insuucient for system speciication. To overcome this limitation, an extension of SC is proposed, the situation and state calculus (SSC), where the concept of state is primitiv...

We investigate the relationship between two accounts of knowledge and action in the situation calculus: the Scherl and Levesque (SL) approach that models knowledge with possible worlds, and the Demolombe and Pozos Parra (DP) approach that models knowledge by a set of “knowledge fluents.” We construct combined action theories: basic action theories that encode a correspondence between an SL and ...

In this work we consider how to enforce norms in the Situation Calculus based programming language Golog and its relatives. We define a notion of norm compliant sequence of actions with respect to norms prescribing some actions to be forbidden or obliged (ought-to-do norms), norms prescribing that a state-condition is forbidden (oughtto-be norms) and norms that are a form of deadline. We then s...

The concept of indirectness (using of tools) in automatic problem solving is investigated, and a formal approach is suggested within the framework of the Situation Calculus. The "Robot and Box" problem serves as an illustrative example throughout the paper.

The situation calculus is a logical formalism that has been extensively developed for planning. We apply the formalism in a complex multi-agent domain, modelled on the game of Clue. We find that the situation calculus, with suitable extensions, supplies a unified representation of (1) the interaction protocol, or structure of the game, (2) the dynamics of the knowledge and common knowledge of t...

Business Process Verification (BPV) works as one of the important functions in the emerging Business Process Management Systems. Current proposed approaches are not yet well applied because of the gap between formal models defined in the academia and informal models used in the industry. This paper attempts to propose a hybrid approach to solve this problem. XPDL will be used to describe busine...