Conditional lexicographic orders in constraint satisfaction problems

Show simple item record

dc.contributor.author Wallace, Richard J.
dc.contributor.author Wilson, Nic
dc.date.accessioned 2013-05-13T13:48:56Z
dc.date.available 2013-05-13T13:48:56Z
dc.date.copyright 2008
dc.date.issued 2009-09
dc.identifier.citation Wallace, 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-3 en
dc.identifier.volume 171 en
dc.identifier.issued 1 en
dc.identifier.startpage 3 en
dc.identifier.endpage 25 en
dc.identifier.uri http://hdl.handle.net/10468/1115
dc.identifier.doi 10.1007/s10479-008-0385-3
dc.description.abstract The 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.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher Springer en
dc.relation.uri http://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-3 en
dc.subject Preference en
dc.subject Lexicographic en
dc.subject Constraint programming en
dc.subject Constraint satisfaction problem en
dc.subject CP-NETS en
dc.subject.lcsh Computer science. en
dc.title Conditional lexicographic orders in constraint satisfaction problems en
dc.type Article (peer-reviewed) en
dc.internal.authorurl http://research.ucc.ie/profiles/D005/nwilson en
dc.internal.authorcontactother Nic Wilson, Computer Science, University College Cork, Cork, Ireland. +353-21-490-3000 Email: n.wilson@4c.ucc.ie en
dc.internal.availability Full text available en
dc.date.updated 2012-12-20T17:37:05Z
dc.description.version Accepted Version en
dc.internal.rssid 43334787
dc.internal.wokid 000270447700002
dc.contributor.funder Science Foundation Ireland en
dc.description.status Peer reviewed en
dc.identifier.journaltitle Annals of Operations Research en
dc.internal.copyrightchecked No. CORA - ROMEO en
dc.internal.licenseacceptance Yes en
dc.internal.IRISemailaddress n.wilson@ucc.ie en
dc.relation.project info:eu-repo/grantAgreement/SFI/SFI Principal Investigator Programme (PI)/00/PI.1/C075/IE/Constraint Computation: Automation and Application/


Files in this item

This item appears in the following Collection(s)

Show simple item record

This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement