We study contractibility and its approximation for two very general classes of soft global constraints. We introduce a general formulation of decomposition-based soft constraints and provide a sufficient condition for contractibility and an approach to approximation. For edit-based soft constraints, we establish that the tightest contractible approximation cannot be expressed in edit-based terms, in general.
@InProceedings{maher:LIPIcs.ICLP.2010.114, author = {Maher, Michael J.}, title = {{Contractibility and Contractible Approximations of Soft Global Constraints}}, booktitle = {Technical Communications of the 26th International Conference on Logic Programming}, pages = {114--123}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-17-0}, ISSN = {1868-8969}, year = {2010}, volume = {7}, editor = {Hermenegildo, Manuel and Schaub, Torsten}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.114}, URN = {urn:nbn:de:0030-drops-25890}, doi = {10.4230/LIPIcs.ICLP.2010.114}, annote = {Keywords: Constraint logic programming, global constraints, open constraints, soft constraints} }
Feedback for Dagstuhl Publishing