An efficient upper approximation for conditional preference

Simple item page
dc.contributor.authorWilson, Nic
dc.contributor.editorBrewka, G.
dc.contributor.editorCoradeschi, S.
dc.contributor.editorPerini, A.
dc.contributor.editorTraverso, P.
dc.contributor.funderScience Foundation Irelanden
dc.date.accessioned2020-11-18T12:27:12Z
dc.date.available2020-11-18T12:27:12Z
dc.date.issued2006-06
dc.date.updated2020-11-04T13:28:26Z
dc.description.abstractThe fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative conditional preferences such as CP-nets and conditional preference theories (CP-theories). It is therefore natural to consider approximations of preference, and upper approximations are of particular interest, since they can be used within a constraint optimisation algorithm to find some of the optimal solutions. Upper approximations for preference in CP-theories have previously been suggested, but they require consistency, as well as strong acyclicity conditions on the variables. We define an upper approximation of conditional preference for which dominance checking is efficient, and which can be applied very generally for CP-theories.en
dc.description.statusPeer revieweden
dc.description.versionPublished Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationWilson, N. (2006) 'An Efficient Upper Approximation for Conditional Preference' European Conference on Artificial Intelligence (ECAI 2006), Riva del Garda, Trentino, Italy, 29 Aug - 1 Sept, pp. 472-476.en
dc.identifier.endpage476en
dc.identifier.isbn978-1-58603-642-3
dc.identifier.isbn978-1-60750-189-3
dc.identifier.journaltitleFrontiers in Artificial Intelligence and Applications: ECAI 2006en
dc.identifier.startpage472en
dc.identifier.urihttps://hdl.handle.net/10468/10772
dc.identifier.volume141en
dc.language.isoenen
dc.publisherIOS Pressen
dc.relation.ispartofFrontiers in Artificial Intelligence and Applications: ECAI 2006
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Principal Investigator Programme (PI)/00/PI.1/C075/IE/Constraint Computation: Automation and Application/en
dc.relation.urihttp://ebooks.iospress.nl/volumearticle/2734
dc.rights© 2006 The authors. All rights reserved. made available under a creative commons license.en
dc.rights.urihttps://creativecommons.org/licenses/by-nc/3.0/deed.en_USen
dc.subjectDominance testingen
dc.subjectCP-netsen
dc.subjectConditional preference theories (CP-theories)en
dc.subjectReasoningen
dc.subjectConstraintsen
dc.subjectConstraint computingen
dc.subjectAIen
dc.subjectArtificial intelligenceen
dc.titleAn efficient upper approximation for conditional preferenceen
dc.typeBook chapteren
dc.typeConference itemen
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
ECAI06Wilson.pdf
Size:
132.17 KB
Format:
Adobe Portable Document Format
Description:
Author's original
Thumbnail Image
Name:
FAIA141-0472.pdf
Size:
185.27 KB
Format:
Adobe Portable Document Format
Description:
Published 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 - Conference Items
Insight Centre for Data Analytics - Conference Items