Enabling local computation for partially ordered preferences

Show simple item record

dc.contributor.author Fargier, Hélène
dc.contributor.author Rollon, Emma
dc.contributor.author Wilson, Nic
dc.date.accessioned 2013-05-13T13:45:37Z
dc.date.available 2013-05-13T13:45:37Z
dc.date.copyright 2010
dc.date.issued 2010-01
dc.identifier.citation Fargier, H,Rollon, E,Wilson, N; (2010) 'Enabling local computation for partially ordered preferences'. Constraints, 15 (4) :516-539. doi: 10.1007/s10601-010-9094-z [untranslated] en
dc.identifier.volume 15 en
dc.identifier.issued 4 en
dc.identifier.startpage 516 en
dc.identifier.endpage 539 en
dc.identifier.uri http://hdl.handle.net/10468/1114
dc.identifier.doi 10.1007/s10601-010-9094-z
dc.description.abstract Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of valuation functions. Shenoy and Shafer showed how such a computation can be performed using a local computation scheme. A major strength of this work is that it is based on an algebraic description: what is proved is the correctness of the local computation algorithm under a few axioms on the algebraic structure. The instantiations of the framework in practice make use of totally ordered scales. The present paper focuses on the use of partially ordered scales and examines how such scales can be cast in the Shafer-Shenoy framework and thus benefit from local computation algorithms. It also provides several examples of such scales, thus showing that each of the algebraic structures explored here is of interest. en
dc.description.sponsorship Science Foundation Ireland (08/PI/11912) 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%2Fs10601-010-9094-z
dc.rights © Springer Science+Business Media, LLC 2010. The final publication is available at http://link.springer.com/article/10.1007%2Fs10601-010-9094-z en
dc.subject Soft constraints en
dc.subject Dynamic programming en
dc.subject Local computation en
dc.subject Valuation networks/algebra en
dc.subject Constraint satisfaction en
dc.subject Optimization en
dc.subject.lcsh Computer science. en
dc.title Enabling local computation for partially ordered preferences 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:34:55Z
dc.description.version Accepted Version en
dc.internal.rssid 70046792
dc.internal.wokid 000280893400004
dc.contributor.funder Science Foundation Ireland en
dc.description.status Peer reviewed en
dc.identifier.journaltitle Constraints en
dc.internal.copyrightchecked Yes. CORA - ROMEO en
dc.internal.licenseacceptance Yes en
dc.internal.IRISemailaddress n.wilson@ucc.ie en


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