Computational techniques for a simple theory of conditional preferences

Show simple item record

dc.contributor.author Wilson, Nic
dc.date.accessioned 2013-04-24T10:04:12Z
dc.date.available 2013-04-24T10:04:12Z
dc.date.issued 2011-05
dc.identifier.citation WILSON, N. 2011. Computational techniques for a simple theory of conditional preferences. Artificial Intelligence, 175 (7-8), 1053-1091. doi: http://dx.doi.org/10.1016/j.artint.2010.11.018 en
dc.identifier.volume 175 en
dc.identifier.issued 7-8 en
dc.identifier.startpage 1053 en
dc.identifier.endpage 1091 en
dc.identifier.issn 0004-3702
dc.identifier.uri http://hdl.handle.net/10468/1082
dc.identifier.doi 10.1016/j.artint.2010.11.018
dc.description.abstract A simple logic of conditional preferences is defined, with a language that allows the compact representation of certain kinds of conditional preference statements, a semantics and a proof theory. CP-nets and TCP-nets can be mapped into this logic, and the semantics and proof theory generalise those of CP-nets and TCP-nets. The system can also express preferences of a lexicographic kind. The paper derives various sufficient conditions for a set of conditional preferences to be consistent, along with algorithmic techniques for checking such conditions and hence confirming consistency. These techniques can also be used for totally ordering outcomes in a way that is consistent with the set of preferences, and they are further developed to give an approach to the problem of constrained optimisation for conditional preferences. en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher Elsevier en
dc.relation.uri http://www.sciencedirect.com/science/article/pii/S0004370210002079
dc.rights Copyright © 2011, Elsevier. NOTICE: this is the author’s version of a work that was accepted for publication in Artificial Intelligence. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Artificial Intelligence [Volume 175, Issues 7–8, May 2011, Pages 1053–1091] http://dx.doi.org/10.1016/j.artint.2010.11.018 en
dc.subject Conditional preferences en
dc.subject Comparative preferences en
dc.subject Ceteris paribus preferences en
dc.subject Lexicographic preferences en
dc.subject Constrained optimisation en
dc.subject TCP-nets en
dc.subject CP-nets en
dc.title Computational techniques for a simple theory of conditional 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:23:07Z
dc.description.version Accepted Version en
dc.internal.rssid 119864809
dc.contributor.funder Science Foundation Ireland en
dc.description.status Peer reviewed en
dc.identifier.journaltitle Artificial Intelligence Journal en
dc.internal.copyrightchecked Yes. CORA - ROMEO accepted version and set statement 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)/08/IN.1/I1912/IE/The Development of Artificial intelligence Approaches for Preferences in Combinational Problems/


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