Conditional lexicographic orders in constraint satisfaction problems

Simple item page
dc.contributor.authorWallace, Richard J.
dc.contributor.authorWilson, Nic
dc.contributor.funderScience Foundation Irelanden
dc.date.accessioned2013-05-13T13:48:56Z
dc.date.available2013-05-13T13:48:56Z
dc.date.copyright2008
dc.date.issued2009-09
dc.date.updated2012-12-20T17:37:05Z
dc.description.abstractThe lexicographically-ordered CSP ("lexicographic CSP" or "LO-CSP" for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs. Preferences are defined by a total ordering across all assignments, such that a change in assignment to a given variable is more important than any change in assignment to any less important variable. In this paper, we show how this representation can be extended to handle conditional preferences in two ways. In the first, for each conditional preference relation, the parents have higher priority than the children in the original lexicographic ordering. In the second, the relation between parents and children need not correspond to the importance ordering of variables. In this case, by obviating the "overwhelming advantage" effect with respect to the original variables and values, the representational capacity is significantly enhanced. For problems of the first type, any of the algorithms originally devised for ordinary LO-CSPs can also be used when some of the domain orderings are dependent on assignments to "parent" variables. For problems of the second type, algorithms based on lexical orders can be used if the representation is augmented by variables and constraints that link preference orders to assignments. In addition, the branch-and-bound algorithm originally devised for ordinary LO-CSPs can be extended to handle CSPs with conditional domain orderings.en
dc.description.statusPeer revieweden
dc.description.versionAccepted Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationWallace, RJ, Wilson, N. (2009) 'Conditional lexicographic orders in constraint satisfaction problems'. Annals of Operations Research, 171 (1): 3-25. doi: 10.1007/s10479-008-0385-3en
dc.identifier.doi10.1007/s10479-008-0385-3
dc.identifier.endpage25en
dc.identifier.issued1en
dc.identifier.journaltitleAnnals of Operations Researchen
dc.identifier.startpage3en
dc.identifier.urihttps://hdl.handle.net/10468/1115
dc.identifier.volume171en
dc.language.isoenen
dc.publisherSpringeren
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Principal Investigator Programme (PI)/00/PI.1/C075/IE/Constraint Computation: Automation and Application/
dc.relation.urihttp://link.springer.com/article/10.1007%2Fs10479-008-0385-3
dc.rights© Springer Science+Business Media, LLC 2008. The final publication is available at http://link.springer.com/article/10.1007%2Fs10479-008-0385-3en
dc.subjectPreferenceen
dc.subjectLexicographicen
dc.subjectConstraint programmingen
dc.subjectConstraint satisfaction problemen
dc.subjectCP-NETSen
dc.subject.lcshComputer science.en
dc.titleConditional lexicographic orders in constraint satisfaction problemsen
dc.typeArticle (peer-reviewed)en
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
WallaceWilsonAnnOperRes09.pdf
Size:
405.42 KB
Format:
Adobe Portable Document Format
Description:
Accepted Version
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
2.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science - Journal Articles
Insight Centre for Data Analytics - Journal Articles