Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
An optimal k-consistency algorithm
Artificial Intelligence
Structure identification in relational data
Artificial Intelligence - Special volume on constraint-based reasoning
A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Closure properties of constraints
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Nonserial Dynamic Programming
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Constraint Processing
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
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)
SIAM Journal on Discrete Mathematics
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM (JACM)
Structure identification of Boolean relations and plain bases for co-clones
Journal of Computer and System Sciences
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
A new line of attack on the dichotomy conjecture
Proceedings of the forty-first annual ACM symposium on Theory of computing
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Constraints, consistency and closure
Artificial Intelligence
The complexity of soft constraint satisfaction
Artificial Intelligence
Communication: Level of repair analysis and minimum cost homomorphisms of graphs
Discrete Applied Mathematics
Approximating fractional hypertree width
ACM Transactions on Algorithms (TALG)
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Constraint Satisfaction Problems of Bounded Width
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
Extensions of the minimum cost homomorphism problem
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
New Conditions for Taylor Varieties and CSP
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in 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)
Hybrid tractability of valued constraint problems
Artificial Intelligence
Min CSP on four elements: moving beyond submodularity
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The Dichotomy for Conservative Constraint Satisfaction Problems Revisited
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
The Power of Linear Programming for Valued CSPs
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
We study the complexity of valued constraint satisfaction problems (VCSPs) parametrized by a constraint language, a fixed set of cost functions over a finite domain. An instance of the problem is specified by a sum of cost functions from the language and the goal is to minimize the sum. Under the unique games conjecture, the approximability of finite-valued VCSPs is well understood, see Raghavendra [2008]. However, there is no characterization of finite-valued VCSPs, let alone general-valued VCSPs, that can be solved exactly in polynomial time, thus giving insights from a combinatorial optimization perspective. We consider the case of languages containing all possible unary cost functions. In the case of languages consisting of only {0,∞}-valued cost functions (i.e., relations), such languages have been called conservative and studied by Bulatov [2003, 2011] and recently by Barto [2011]. Since we study valued languages, we call a language conservative if it contains all finite-valued unary cost functions. The computational complexity of conservative valued languages has been studied by Cohen et al. [2006] for languages over Boolean domains, by Deineko et al. [2008] for {0,1}-valued languages (a.k.a Max-CSP), and by Takhanov [2010a] for {0,∞}-valued languages containing all finite-valued unary cost functions (a.k.a. Min-Cost-Hom). We prove a Schaefer-like dichotomy theorem for conservative valued languages: if all cost functions in the language satisfy a certain condition (specified by a complementary combination of STP and MJN multimorphisms), then any instance can be solved in polynomial time (via a new algorithm developed in this article), otherwise the language is NP-hard. This is the first complete complexity classification of general-valued constraint languages over non-Boolean domains. It is a common phenomenon that complexity classifications of problems over non-Boolean domains are significantly harder than the Boolean cases. The polynomial-time algorithm we present for the tractable cases is a generalization of the submodular minimization problem and a result of Cohen et al. [2008]. Our results generalize previous results by Takhanov [2010a] and (a subset of results) by Cohen et al. [2006] and Deineko et al. [2008]. Moreover, our results do not rely on any computer-assisted search as in Deineko et al. [2008], and provide a powerful tool for proving hardness of finite-valued and general-valued languages.