A new tractable class of constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
Two algorithms for general list matrix partitions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of partition functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
A rendezvous of logic, complexity, and algebra
ACM SIGACT News
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Majority constraints have bounded pathwidth duality
European Journal of Combinatorics
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM (JACM)
Non-dichotomies in Constraint Satisfaction Complexity
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
There are no pure relational width 2 constraint satisfaction problems
Information Processing Letters
Relatively quantified constraint satisfaction
Constraints
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Existentially restricted quantified constraint satisfaction
Information and Computation
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science
A new line of attack on the dichotomy conjecture
Proceedings of the forty-first annual ACM symposium on Theory of computing
Hybrid tractable CSPs which generalize tree structure
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
The complexity of constraint satisfaction games and QCSP
Information and Computation
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
A maximal tractable class of soft constraints
Journal of Artificial Intelligence Research
Constraint satisfaction, databases, and logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Approximating fractional hypertree width
ACM Transactions on Algorithms (TALG)
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Constraint satisfaction problems and global cardinality constraints
Communications of the ACM
CSP duality and trees of bounded pathwidth
Theoretical Computer Science
Constraint satisfaction with succinctly specified relations
Journal of Computer and System Sciences
Minimum cost homomorphisms to oriented cycles with some loops
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Parameterized complexity and kernelizability of max ones and exact ones problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Extensions of the minimum cost homomorphism problem
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Congruence Distributivity Implies Bounded Width
SIAM Journal on Computing
Tractability and Learnability Arising from Algebras with Few Subpowers
SIAM Journal on Computing
Note: The Ck-extended graft construction
Discrete Applied Mathematics
On the CSP dichotomy conjecture
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Constraint satisfaction parameterized by solution size
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
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
Submodularity on a tree: unifying L-convex and bisubmodular functions
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The computational complexity of disconnected cut and 2K2-partition
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Quantified Equality Constraints
SIAM Journal on Computing
The complexity of equality constraint languages
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
The complexity of conservative valued CSPs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Looking algebraically at tractable quantified boolean formulas
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Journal of Computer and System Sciences
The dichotomy of list homomorphisms for digraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Systems of equations over finite semigroups and the #CSP dichotomy conjecture
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The core of a countably categorical structure
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
A dichotomy theorem for typed constraint satisfaction problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Ruling out polynomial-time approximation schemes for hard constraint satisfaction problems
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Combinatorial proof that subprojective constraint satisfaction problems are NP-complete
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Generic expression hardness results for primitive positive formula comparison
Information and Computation
The tractability of CSP classes defined by forbidden patterns
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Weak near-unanimity functions and digraph homomorphism problems
Theoretical Computer Science
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
Graph partitions with prescribed patterns
European Journal of Combinatorics
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Journal of the ACM (JACM)
Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.02 |
In a constraint satisfaction problem (CSP) the aim is tofind an assignment of values to a given set of variables, subjectto specified constraints. The CSP is known to be NP-completein general. However, certain restrictions on theform of the allowed constraints can lead to problems solvablein polynomial time. Such restrictions are usually imposedby specifying a constraint language. The principalresearch direction aims to distinguish those constraint languageswhich give rise to tractable CSPs from those whichdo not.We achieve this goal for the widely used variant of theCSP, in which the set of values for each individual variablecan be restricted arbitrarily. Restrictions of this typecan be expressed by including in a constraint language allpossible unary constraints. Constraint languages containingall unary constraints will be called conservative. Wecompletely characterize conservative constraint languagesthat give rise to CSP classes solvable in polynomial time.In particular, this result allows us to obtain a complete descriptionof those (directed) graphs H for which the LISTH-COLORING problem is polynomial time solvable.