Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Characterising tractable constraints
Artificial Intelligence
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family
Proceedings of the 17th International Conference on Logic Programming
On the Satisfiability of Symmetrical Constrained Satisfaction Problems
ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
Automatic Generation of Music Programs
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Global Constraints for Lexicographic Orderings
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Filtering Algorithms for the NValue Constraint
Constraints
Tractable cases of the extended global cardinality constraint
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
The complexity of global constraints
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Backdoors to typical case complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Decomposing global grammar constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Among, common and disjoint constraints
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
Artificial Intelligence
Decomposition of the NVALUE constraint
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Kernels for global constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Breaking variable symmetry in almost injective problems
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
On the complexity of global scheduling constraints under structural restrictions
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them fixed-parameter tractable and which are easy to compute. This tractability tends either to be the result of a simple dynamic program or of a decomposition which has a strong backdoor of bounded size. This strong backdoor is often a cycle cutset. We also show that parameterized complexity can be used to study other aspects of constraint programming like symmetry breaking. For instance, we prove that value symmetry is fixed-parameter tractable to break in the number of symmetries. Finally, we argue that parameterized complexity can be used to derive results about the approximability of constraint propagation.