Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Possibilistic constraint satisfaction problems or “how to handle soft constraints?”
UAI '92 Proceedings of the eighth conference on Uncertainty in 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)
Optimization-Oriented Global Constraints
Constraints
Arc Consistency for Global Cardinality Constraints with Costs
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 6th 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
Node and arc consistency in weighted CSP
Eighteenth national conference on Artificial intelligence
Constraint Processing
Principles of Constraint Programming
Principles of Constraint Programming
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
In the quest of the best form of local consistency for weighted CSP
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Modeling the Regular Constraint with Integer Programming
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A Soft Constraint of Equality: Complexity and Approximability
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Softening Gcc and Regular with preferences
Proceedings of the 2009 ACM symposium on Applied Computing
Sequencing and Counting with the multicost-regular Constraint
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
SLIDE: A Useful Special Case of the CARDPATH Constraint
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Decompositions of grammar constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Bounds arc consistency for weighted CSPs
Journal of Artificial Intelligence Research
Towards efficient consistency enforcement for global constraints in weighted constraint satisfaction
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Reformulating global constraints: the slide and regular constraints
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Fitness-distance correlation and solution-guided multi-point constructive search for CSPs
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Solving nurse rostering problems using soft global constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Constraints of difference and equality: a complete taxonomic characterisation
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
SOGgy constraints: soft open global constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A 25-year perspective on logic programming
A new hybrid tractable class of soft constraint problems
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A propagator for maximum weight string alignment with arbitrary pairwise dependencies
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
An efficient generic network flow constraint
Proceedings of the 2011 ACM Symposium on Applied Computing
Hybrid tractability of valued constraint problems
Artificial Intelligence
Hierarchically nested convex VCSP
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Soft constraints of difference and equality
Journal of Artificial Intelligence Research
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Open constraints in a closed world
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Improved algorithm for the soft global cardinality constraint
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Revisiting the soft global cardinality constraint
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An automaton Constraint for Local Search
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Journal of Artificial Intelligence Research
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
Including soft global constraints in DCOPs
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that can be represented by a flow in a graph. Such constraints are softened by adding violation arcs to the graph and then computing a minimum-weight flow in the extended graph to measure the violation. We present efficient propagation algorithms, based on different violation measures, achieving domain consistency for the alldifferent constraint, the global cardinality constraint, the regular constraint and the same constraint.