Constraints, consistency and closure

Authors:
Peter Jeavons;David Cohen;Martin C. Cooper
Affiliations:
Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 OEX, UK;Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 OEX, UK;University of Toulouse, France
Venue:
Artificial Intelligence
Year:
1998

Citing 23
Cited 33

A sufficient condition for backtrack-bounded search

Journal of the ACM (JACM)
Network-based heuristics for constraint-satisfaction problems

Artificial Intelligence
An optimal k-consistency algorithm

Artificial Intelligence
Constraint relaxation may be perfect

Artificial Intelligence
Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
From local to global consistency

Artificial Intelligence
A generic arc-consistency algorithm and its specializations

Artificial Intelligence
Fast parallel constraint satisfaction

Artificial Intelligence
Monotone monadic SNP and constraint satisfaction

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On binary constraint problems

Journal of the ACM (JACM)
Decomposing constraint satisfaction problems using database techniques

Artificial Intelligence
Characterising tractable constraints

Artificial Intelligence
On the minimality and global consistency of row-convex constraint networks

Journal of the ACM (JACM)
Tractable constraints on ordered domains

Artificial Intelligence
Closure properties of constraints

Journal of the ACM (JACM)
Constraint tightness and looseness versus local and global consistency

Journal of the ACM (JACM)
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)
A relational model of data for large shared data banks

Communications of the ACM
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
An Algebraic Characterization of Tractable Constraints

COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
A Unifying Framework for Tractable Constraints

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On the minimality and decomposability of constraint networks

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence

On Consistency and Width Notions for Constraint Programs with Algebraic Constraints

FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Solving Order Constraints in Logarithmic Space

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Learnability of Quantified Formulas

EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Constructing Constraints

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Boolean Formulas are Hard to Learn for most Gate Bases

ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Classes of Submodular Constraints Expressible by Graph Cuts

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Recent Results on the Algebraic Approach to the CSP

Complexity of Constraints
Dualities for Constraint Satisfaction Problems

Complexity of Constraints
A rendezvous of logic, complexity, and algebra

ACM Computing Surveys (CSUR)
The complexity of soft constraint satisfaction

Artificial Intelligence
The expressive power of valued constraints: hierarchies and collapses

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Classes of submodular constraints expressible by graph cuts

Constraints
Constraint satisfaction with succinctly specified relations

Journal of Computer and System Sciences
Distance constraint satisfaction problems

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Tractability and Learnability Arising from Algebras with Few Subpowers

SIAM Journal on Computing
Complexity of conservative constraint satisfaction problems

ACM Transactions on Computational Logic (TOCL)
On the CSP dichotomy conjecture

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
The complexity of conservative valued CSPs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Datalog and constraint satisfaction with infinite templates

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Looking algebraically at tractable quantified boolean formulas

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Collapsibility in infinite-domain quantified constraint satisfaction

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On the tractability of smooth constraint satisfaction problems

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
From pebble games to tractability: an ambidextrous consistency algorithm for quantified constraint satisfaction

CSL'05 Proceedings of the 19th international conference on Computer Science Logic
A CSP search algorithm with reduced branching factor

CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
An efficient algorithm for a class of constraint satisfaction problems

Operations Research Letters
Meditations on quantified constraint satisfaction

Logic and Program Semantics
Qualitative temporal and spatial reasoning revisited

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Datalog and constraint satisfaction with infinite templates

Journal of Computer and System Sciences
The complexity of conservative valued CSPs

Journal of the ACM (JACM)
The complexity of the counting constraint satisfaction problem

Journal of the ACM (JACM)
Belief revision within fragments of propositional logic

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

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.