2026-08-16T09:53:09Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2589 2024-03-06T10:33:33Z ddc:004 open_access

Contractibility and Contractible Approximations of Soft Global Constraints Maher, Michael J. Constraint logic programming global constraints open constraints soft constraints 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Michael J. Maher 2010 Is Part Of LIPIcs, Volume 7, Technical Communications of the 26th International Conference on Logic Programming (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICLP.2010.114 urn:nbn:de:0030-drops-25890 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.114 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode