Computational techniques for a simple theory of conditional preferences

Simple item page
dc.contributor.authorWilson, Nic
dc.contributor.funderScience Foundation Irelanden
dc.date.accessioned2013-04-24T10:04:12Z
dc.date.available2013-04-24T10:04:12Z
dc.date.issued2011-05
dc.date.updated2012-12-20T17:23:07Z
dc.description.abstractA 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.description.statusPeer revieweden
dc.description.versionAccepted Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationWILSON, 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.018en
dc.identifier.doi10.1016/j.artint.2010.11.018
dc.identifier.endpage1091en
dc.identifier.issn0004-3702
dc.identifier.issued7-8en
dc.identifier.journaltitleArtificial Intelligence Journalen
dc.identifier.startpage1053en
dc.identifier.urihttps://hdl.handle.net/10468/1082
dc.identifier.volume175en
dc.language.isoenen
dc.publisherElsevieren
dc.relation.projectinfo: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/
dc.relation.urihttp://www.sciencedirect.com/science/article/pii/S0004370210002079
dc.rights© 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.018en
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/en
dc.subjectConditional preferencesen
dc.subjectComparative preferencesen
dc.subjectCeteris paribus preferencesen
dc.subjectLexicographic preferencesen
dc.subjectConstrained optimisationen
dc.subjectTCP-netsen
dc.subjectCP-netsen
dc.titleComputational techniques for a simple theory of conditional preferencesen
dc.typeArticle (peer-reviewed)en
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CP-theory-AIJ-2011.pdf
Size:
615.53 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