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

A set of vertices S in a graph G is a clique if any two of its vertices are adjacent. The clique number ω is the maximum cardinality of a clique in G. A series of best possible lower and upper bounds on the difference, sum, ratio or product of ω and some other common invariants of G were obtained by the system AGX 2, and most of them proved either automatically or by hand. In the present paper,...

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

Structural causal models offer a popular framework for exploring causal concepts. However, due to their limited expressiveness, structural models have difficulties coping with such concepts as actual (event-to-event) causation. In this paper, we propose a new type of causal model, based on embedding structural considerations in the language of situation calculus. By using situation calculus as ...

We add branching time to the linear discrete event calculus, which yields a formalism for commonsense reasoning that combines the benefits of the situation calculus and the event calculus. We characterize the precise relationship between the linear and branching versions of the discrete event calculus, and prove that a restricted version of the branching discrete event calculus is equivalent to...

When agents like mobile robots make observations while carrying out a course of actions, a formalization of the observed information is needed in order to reason about it. When doing so in the situation calculus, a seemingly straightforward approach turns out to be inappropriate since it leads to unintended results and has an unfortunate sensitivity with respect to different forms of successor ...