SOGgy constraints: soft open global constraints

Authors:
Michael J. Maher
Affiliations:
NICTA and University of NSW, Sydney, Australia
Venue:
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Year:
2009

Citing 7
Cited 1

Specific Filtering Algorithms for Over-Constrained Problems

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraint Processing

Constraint Processing
On global warming: Flow-based soft global constraints

Journal of Heuristics
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
SLIDE: A Useful Special Case of the CARDPATH Constraint

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Open contractible global constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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

Including soft global constraints in DCOPs

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate soft open constraints. We generalize and unify classes of soft constraints and adapt them to the open setting. We give sufficient conditions for generalized classes of decomposition-based and edit-based soft constraints to be contractible. Finally, we outline a propagator for an open generalized edit-based soft Regular constraint.