Temporal Reasoning

Multiagent Simple Temporal Problem: The Arc-Consistency Approach

The Simple Temporal Problem (STP) is a fundamental temporal reasoning problem and has recently been extended to the Multiagent Simple Temporal Problem (MaSTP). In this paper we present a novel approach that is based on enforcing arc-consistency (AC) …

A Survey of Qualitative Spatial and Temporal Calculi: Algebraic and Computational Properties

Qualitative spatial and temporal reasoning (QSTR) is concerned with symbolic knowledge representation, typically over infinite domains. The motivations for employing QSTR techniques include exploiting computational properties that allow efficient …

Connecting Qualitative Spatial and Temporal Representations by Propositional Closure

On Redundancy in Simple Temporal Networks

The Simple Temporal Problem (STP) has been widely used in various applications to schedule tasks. For dynamical systems, scheduling needs to be efficient and flexible to handle uncertainty and perturbation. To this end, modern approaches usually …