Constraints, Consistency, and Closure (1998)
| Venue: | Artificial Intelligence |
| Citations: | 39 - 11 self |
BibTeX
@ARTICLE{Jeavons98constraints,consistency,,
author = {Peter Jeavons and David Cohen and Martin Cooper},
title = {Constraints, Consistency, and Closure},
journal = {Artificial Intelligence},
year = {1998},
volume = {101},
pages = {101--1}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 1 Introduction The constraint satisfaction problem provides a framework in which it is possible to express, in a natural way, many combinatorial problems encountered in artificial intelligence and elsewhere. The aim in a constraint satisfaction problem is to find an assignment of values to a given set of variables subject to constraints on the values which can be assigned simultaneously to certain specified subsets of variables. The constraint satisfaction problem is known to be an NP-complete problem in ge...
