Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Scheduling independent tasks to reduce mean finishing time
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
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Specific Filtering Algorithms for Over-Constrained Problems
CP '01 Proceedings of the 7th 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
Constraint Processing
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Combinatorica
On global warming: Flow-based soft global constraints
Journal of Heuristics
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
All Different: Softening AllDifferent in Weighted CSPs
ICTAI '07 Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Perfect Constraints Are Tractable
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Journal of Discrete Algorithms
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
The complexity of soft constraint satisfaction
Artificial Intelligence
Towards efficient consistency enforcement for global constraints in weighted constraint satisfaction
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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
MAP estimation, message passing, and perfect graphs
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Independent Sets of Maximum Weight in Apple-Free Graphs
SIAM Journal on Discrete Mathematics
Hierarchically nested convex VCSP
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
A characterisation of the complexity of forbidding subproblems in binary Max-CSP
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
The tractability of CSP classes defined by forbidden patterns
Journal of Artificial Intelligence Research
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
The complexity of finite-valued CSPs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
The constraint satisfaction problem (CSP) is a central generic problem in computer science and artificial intelligence: it provides a common framework for many theoretical problems as well as for many real-life applications. Valued constraint problems are a generalisation of the CSP which allow the user to model optimisation problems. Considerable effort has been made in identifying properties which ensure tractability in such problems. In this work, we initiate the study of hybrid tractability of valued constraint problems; that is, properties which guarantee tractability of the given valued constraint problem, but which do not depend only on the underlying structure of the instance (such as being tree-structured) or only on the types of valued constraints in the instance (such as submodularity). We present several novel hybrid classes of valued constraint problems in which all unary constraints are allowed, which include a machine scheduling problem, constraint problems of arbitrary arities with no overlapping nogoods, and the SoftAllDiff constraint with arbitrary unary valued constraints. An important tool in our investigation will be the notion of forbidden substructures.