On the consistency of general constraint-satisfaction problems

Authors:
Philippe Jégou
Affiliations:
L.l.U.P., Université de Provence, Marseille cedex 3, France
Venue:
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Year:
1993

Citing 9
Cited 1

Arc and path consistence revisited

Artificial Intelligence
Network-based heuristics for constraint-satisfaction problems

Artificial Intelligence
Tree clustering for constraint networks (research note)

Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition

Artificial Intelligence
On some partial line graphs of a hypergraph and the associated matroid

Discrete Mathematics
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Synthesizing constraint expressions

Communications of the ACM
Theory of Relational Databases

Theory of Relational Databases

Constraint based approach for the steady-state simulation of complex systems: Application to ship control

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of checking for consistency of Constraint-Satisfaction Problems (CSPs) is a fundamental problem in the field of constraint-based reasonning. Moreover, it is a hard problem since satisfiability of CSPs belongs to the class of NPcomplete problems. So, in (Freuder 1982), Freuder gave theoretical results concerning consistency of binary CSPs (two variables per constraints). In this paper, we proposed an extension to these results to general CSP (n-ary constraints). On one hand, we define a partial consistency well adjusted to general CSPs called hyper-k-consistency. On the other hand, we proposed a measure of the connectivity of hypergraphs called width of hypergraphs. Using width of hypergraphs and hyper-k-consistency, we derive a theorem defining a sufficient condition for consistency of general CSPs.