Softening Gcc and Regular with preferences

Authors:
Jean-Philippe Métivier;Patrice Boizumault;Samir Loudni
Affiliations:
University of Caen, Caen, Cedex -- France;University of Caen, Caen, Cedex -- France;University of Caen, Caen, Cedex -- France
Venue:
Proceedings of the 2009 ACM symposium on Applied Computing
Year:
2009

Citing 6
Cited 1

Constraint satisfaction using constraint logic programming

Artificial Intelligence - Special volume on constraint-based reasoning
Arc Consistency for Global Cardinality Constraints with Costs

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
On global warming: Flow-based soft global constraints

Journal of Heuristics
All Different: Softening AllDifferent in Weighted CSPs

ICTAI '07 Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
Generalized arc consistency for global cardinality constraint

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
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

Solving nurse rostering problems using soft global constraints

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present the soft global constraints Σ-gcc and Σ-regular which are the soft versions with preferences of well-known global constraints Gcc and Regular. For each of them, we introduce a new violation based semantic which takes into account preferences and propose algorithms to enforce hyperarc consistency in polynomial time, making use of flow theory.