Constraint Satisfaction Problems

A new distributed algorithm for efficient generalized arc-consistency propagation

Generalized arc-consistency propagation is predominantly used in constraint solvers to efficiently prune the search space when solving constraint satisfaction problems. Although many practical applications can be modelled as distributed constraint …

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 Deterministic Distributed Algorithm for Reasoning with Connected Row-Convex Constraints

The class of CRC constraints generalizes several tractable classes of constraints and is expressive enough to model problems in domains such as temporal reasoning, geometric reasoning, and scene labelling. This paper presents the first distributed …