dc.contributor.author | Brafman, R. I. | en |
dc.contributor.author | Dimopoulos, Yannis | en |
dc.creator | Brafman, R. I. | en |
dc.creator | Dimopoulos, Yannis | en |
dc.date.accessioned | 2019-11-13T10:38:29Z | |
dc.date.available | 2019-11-13T10:38:29Z | |
dc.date.issued | 2004 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/53649 | |
dc.description.abstract | Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. Ceteris paribus (CP)-nets were designed to make the process of preference elicitation simpler and more intuitive for lay users by graphically structuring a set of CP preference statements - preference statements that most people find natural and intuitive. Beside their usefulness in the process of preference elicitation, CP-nets support efficient optimization algorithms that are crucial in most applications (e.g., the selection of the best action to execute or the best product configuration). In various contexts, CP-nets with an underlying cyclic structure emerge naturally. Often, they are inconsistent according to the current semantics, and the user is required to revise them. In this paper, we show how optimization queries can be meaningfully answered in many "inconsistent" networks without troubling the user with requests for revisions. In addition, we describe a method for focusing the user's revision process when revisions are truly needed. In the process, we provide a formal semantics that justifies our approach and new techniques for computing optimal outcomes. Some of the methods we use are based on a reduction to the problem of computing stable models for nonmonotonic logic programs, and we explore this relationship closely. | en |
dc.source | Computational Intelligence | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-2442589725&partnerID=40&md5=cfe6ca1ac941d7cec3d4b2de44e2d6e2 | |
dc.subject | Mathematical models | en |
dc.subject | Optimization | en |
dc.subject | Decision theory | en |
dc.subject | Algorithms | en |
dc.subject | Graph theory | en |
dc.subject | Semantics | en |
dc.subject | Intelligent agents | en |
dc.subject | Logic programming | en |
dc.subject | Knowledge representation | en |
dc.subject | Answer-set programming | en |
dc.subject | Cp-nets | en |
dc.subject | CP-networks | en |
dc.subject | Graphic models | en |
dc.subject | Graphical models | en |
dc.subject | Non-monotonic logic programs | en |
dc.subject | Preference elicitation | en |
dc.title | Extended semantics and optimization algorithms for CP-networks | en |
dc.type | info:eu-repo/semantics/article | |
dc.description.volume | 20 | |
dc.description.issue | 2 | |
dc.description.startingpage | 218 | |
dc.description.endingpage | 245 | |
dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
dc.type.uhtype | Article | en |
dc.description.notes | <p>Cited By :31</p> | en |
dc.source.abbreviation | Comput.Intell. | en |
dc.contributor.orcid | Dimopoulos, Yannis [0000-0001-9583-9754] | |
dc.gnosis.orcid | 0000-0001-9583-9754 | |