dc.contributor.author |
Wilson, Nic |
|
dc.contributor.editor |
Brewka, G. |
|
dc.contributor.editor |
Coradeschi, S. |
|
dc.contributor.editor |
Perini, A. |
|
dc.contributor.editor |
Traverso, P. |
|
dc.date.accessioned |
2020-11-18T12:27:12Z |
|
dc.date.available |
2020-11-18T12:27:12Z |
|
dc.date.issued |
2006-06 |
|
dc.identifier.citation |
Wilson, 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.volume |
141 |
en |
dc.identifier.startpage |
472 |
en |
dc.identifier.endpage |
476 |
en |
dc.identifier.isbn |
978-1-58603-642-3 |
|
dc.identifier.isbn |
978-1-60750-189-3 |
|
dc.identifier.uri |
http://hdl.handle.net/10468/10772 |
|
dc.description.abstract |
The 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.format.mimetype |
application/pdf |
en |
dc.language.iso |
en |
en |
dc.publisher |
IOS Press |
en |
dc.relation.ispartof |
Frontiers in Artificial Intelligence and Applications: ECAI 2006 |
|
dc.relation.uri |
http://ebooks.iospress.nl/volumearticle/2734 |
|
dc.rights |
© 2006 The authors. All rights reserved. made available under a creative commons license. |
en |
dc.rights.uri |
https://creativecommons.org/licenses/by-nc/3.0/deed.en_US |
en |
dc.subject |
Dominance testing |
en |
dc.subject |
CP-nets |
en |
dc.subject |
Conditional preference theories (CP-theories) |
en |
dc.subject |
Reasoning |
en |
dc.subject |
Constraints |
en |
dc.subject |
Constraint computing |
en |
dc.subject |
AI |
en |
dc.subject |
Artificial intelligence |
en |
dc.title |
An efficient upper approximation for conditional preference |
en |
dc.type |
Book chapter |
en |
dc.type |
Conference item |
en |
dc.internal.authorcontactother |
Nic Wilson, Computer Science, University College Cork, Cork, Ireland. +353-21-490-3000 Email: n.wilson@ucc.ie |
en |
dc.internal.availability |
Full text available |
en |
dc.date.updated |
2020-11-04T13:28:26Z |
|
dc.description.version |
Published Version |
en |
dc.internal.rssid |
52485592 |
|
dc.contributor.funder |
Science Foundation Ireland
|
en |
dc.description.status |
Peer reviewed |
en |
dc.identifier.journaltitle |
Frontiers in Artificial Intelligence and Applications: ECAI 2006 |
en |
dc.internal.copyrightchecked |
No |
|
dc.internal.licenseacceptance |
Yes |
en |
dc.internal.conferencelocation |
Riva del Garda, Trentino, Italy |
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/
|
en |