Constraint Satisfaction Problems of Bounded Width

Authors:
Libor Barto;Marcin Kozik
Affiliations:
-;-
Venue:
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Year:
2009

Citing 0
Cited 31

Constraint satisfaction problems and global cardinality constraints

Communications of the ACM
CSP duality and trees of bounded pathwidth

Theoretical Computer Science
Local consistency and SAT-solvers

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Tree dualities for constraint satisfaction

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Maltsev digraphs have a majority polymorphism

European Journal of Combinatorics
Congruence Distributivity Implies Bounded Width

SIAM Journal on Computing
Tractability and Learnability Arising from Algebras with Few Subpowers

SIAM Journal on Computing
On the CSP dichotomy conjecture

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Generic expression hardness results for primitive positive formula comparison

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
An algebraic theory of complexity for valued constraints: establishing a Galois connection

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On minimal weighted clones

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Quantified Equality Constraints

SIAM Journal on Computing
Linear programming, width-1 CSPs, and robust satisfaction

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
The complexity of conservative valued CSPs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The dichotomy of list homomorphisms for digraphs

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Robust satisfiability of constraint satisfaction problems

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Tractable set constraints

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Meditations on quantified constraint satisfaction

Logic and Program Semantics
Near Unanimity Constraints Have Bounded Pathwidth Duality

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Local consistency and SAT-solvers

Journal of Artificial Intelligence Research
Datalog and constraint satisfaction with infinite templates

Journal of Computer and System Sciences
Generic expression hardness results for primitive positive formula comparison

Information and Computation
On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction

Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Tractable set constraints

Journal of Artificial Intelligence Research
The complexity of conservative valued CSPs

Journal of the ACM (JACM)
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP

Proceedings of the 32nd symposium on Principles of database systems
The complexity of finite-valued CSPs

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Robust Satisfiability for CSPs: Hardness and Algorithmic Results

ACM Transactions on Computation Theory (TOCT)
Constraint Satisfaction Problems Solvable by Local Consistency Methods

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.02

Visualization

Abstract

We provide a full characterization of applicability of The Local Consistency Checking algorithm to solving the non-uniform Constraint Satisfaction Problems. This settles the conjecture of Larose and Zadori.