Contractibility and Contractible Approximations of Soft Global Constraints

Author Michael J. Maher

Thumbnail PDF


  • Filesize: 301 kB
  • 10 pages

Document Identifiers

Author Details

Michael J. Maher

Cite AsGet BibTex

Michael J. Maher. Contractibility and Contractible Approximations of Soft Global Constraints. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 114-123, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


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.
  • Constraint logic programming
  • global constraints
  • open constraints
  • soft constraints


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail