License: 
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2010.114
URN: urn:nbn:de:0030-drops-25890
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2589/
Maher, Michael J.
Contractibility and Contractible Approximations of Soft Global Constraints
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.
BibTeX - Entry
@InProceedings{maher:LIPIcs:2010:2589,
author = {Michael J. Maher},
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 = {Manuel Hermenegildo and Torsten Schaub},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2589},
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}
}
|
Keywords: |
|
Constraint logic programming, global constraints, open constraints, soft constraints |
|
Collection: |
|
Technical Communications of the 26th International Conference on Logic Programming |
|
Issue Date: |
|
2010 |
|
Date of publication: |
|
25.06.2010 |
