Contractibility and Contractible Approximations of Soft Global Constraints

Maher, Michael J.

doi:10.4230/LIPIcs.ICLP.2010.114

Document

Contractibility and Contractible Approximations of Soft Global Constraints

Author Michael J. Maher

Part of: Volume: Technical Communications of the 26th International Conference on Logic Programming (ICLP 2010)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: International Conference on Logic Programming (ICLP)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2010-06-25

PDF

File

PDF

LIPIcs.ICLP.2010.114.pdf

Filesize: 301 kB
10 pages

Document Identifiers

DOI: 10.4230/LIPIcs.ICLP.2010.114
URN: urn:nbn:de:0030-drops-25890

Subject Classification

Keywords

Constraint logic programming
global constraints
open constraints
soft constraints

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

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.

Cite As Get 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) https://doi.org/10.4230/LIPIcs.ICLP.2010.114

Author Details

Michael J. Maher

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