Constraints, consistency and closure

https://doi.org/10.1016/S0004-3702(98)00022-8Get rights and content
Under an Elsevier user license
open archive

Abstract

Although the constraint satisfaction problem is NP-complete in general, a number of constraint classes have been identified for which some fixed level of local consistency is sufficient to ensure global consistency. In this paper we describe a simple algebraic property which characterises all possible constraint types for which strong k-consistency is sufficient to ensure global consistency, for each k > 2. We give a number of examples to illustrate the application of this result.

Keywords

Constraint class
Global consistency
Local consistency
Tractability
Algebraic closure

Cited by (0)