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

When reasoning about actions and sensors in realistic domains, the ability to cope with uncertainty often plays an essential role. Among the approaches dealing with uncertainty, the one by Bacchus, Halpern and Levesque, which uses the situation calculus, is perhaps the most expressive. However, there are still some open issues. For example, it remains unclear what an agent’s knowledge base woul...

We present our experience in creating a novel unsupervised clustering algorithm for situation-aware pattern extraction from usage logs. The algorithm automatically estimates nearoptimal number of clusters and cluster centroids. It models situation by taking advantage of sensors. 5-fold cross validations using real-world data show that the algorithm delivers higher accuracy than existing algorit...

This paper begins with the assumption that possible worlds and times are represented as situation pronouns in natural language (see Cresswell, 1990; Percus, 2000; Kusumoto, 2005; Keshet, 2008). For simplicity, situations are construed to be world-time pairs, and a predicate taking such a pair as an argument is evaluated in the world and the time specified. Researchers such as Percus (2000) have...

Many practical problems where the environment is not in the system’s control can be modelled in game-theoretic logics (e.g., ATL). But most work on verification methods for such logics is restricted to finite state cases. De Giacomo, Lespérance, and Pearce have proposed a situation calculus-based logical framework for representing such infinite state game-type problems together with a verificat...

The ability of interval arithmetic to provide a finite (and succinct) way to represent uncertainty about a large, possibly uncountable, set of alternatives turns out to be useful in building “intelligent” autonomous agents. In particular, consider the two important issues of reasoning and sensing in intelligent control for autonomous agents. Developing a principled way to combine the two raises...

This article describes one possible option on how the flexible and open world of Semantic Web Technologies such as the Resource Description Framework, the Web Ontology Language (OWL) or other languages compatible to the Jena-Model can be integrated with logic based agents implementing the so called Situation Calculus. By integrating both systems tightly all systems’ features are technically mad...

When it comes to robotic agents operating in an uncertain world, a major concern in knowledge representation is to better relate high-level logical accounts of belief and action to the low-level probabilistic sensorimotor data. Perhaps the most general formalism for dealing with degrees of belief and, in particular, how such beliefs should evolve in the presence of noisy sensing and acting is t...