CP-nets:: A tool for representing and reasoning with conditional ceteris paribus preference statements

被引:483
|
作者
Boutilier, C [1 ]
Brafman, RI
Domshlak, C
Hoos, HH
Poole, D
机构
[1] Univ Toronto, Dept Comp Sci, Toronto, ON M5S 3H8, Canada
[2] Ben Gurion Univ Negev, Dept Comp Sci, IL-84105 Beer Sheva, Israel
[3] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA
[4] Univ British Columbia, Dept Comp Sci, Vancouver, BC V6T 1Z4, Canada
关键词
D O I
10.1613/jair.1234
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Information about user preferences plays a key role in automated decision making. In many domains it is desirable to assess such preferences in a qualitative rather than quantitative way. In this paper, we propose a qualitative graphical representation of preferences that reflects conditional dependence and independence of preference statements under a ceteris paribus (all else being equal) interpretation. Such a representation is often compact and arguably quite natural in many circumstances. We provide a formal semantics for this model, and describe how the structure of the network can be exploited in several inference tasks, such as determining whether one outcome dominates (is preferred to) another, ordering a set outcomes according to the preference relation, and constructing the best outcome subject to available evidence.
引用
收藏
页码:135 / 191
页数:57
相关论文
共 18 条
  • [1] Reasoning with conditional ceteris paribus preference statements
    Boutilier, C
    Brafman, RI
    Hoos, HH
    Poole, D
    UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 1999, : 71 - 80
  • [2] Extending CP-nets with stronger conditional preference statements
    Wilson, N
    PROCEEDING OF THE NINETEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE SIXTEENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2004, : 735 - 741
  • [3] Reasoning about ceteris paribus preference with constraint hierarchy framework
    Zhang, YG
    Sun, JG
    PROCEEDINGS OF 2005 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-9, 2005, : 2722 - 2726
  • [4] Preference Aggregation with Incomplete CP-nets
    Haret, Adrian
    Novaro, Arianna
    Grandi, Umberto
    SIXTEENTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2018, : 308 - 317
  • [5] Operators of preference composition for CP-nets
    Sun, Xuejiao
    Liu, Jinglei
    Wang, Kai
    EXPERT SYSTEMS WITH APPLICATIONS, 2017, 86 : 32 - 41
  • [6] Models for Conditional Preferences as Extensions of CP-Nets
    Cornelio, Cristina
    PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 4355 - 4356
  • [7] A Tool to Graphically Edit CP-Nets
    Shafran, Aidan
    Saarinen, Sam
    Goldsmith, Judy
    THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 4387 - 4388
  • [8] Reasoning and Negotiating with Complex Preferences Using CP-Nets
    Aydogan, Reyhan
    Tasdemir, Nuri
    Yolum, Pinar
    AGENT-MEDIATED ELECTRONIC COMMERCE AND TRADING AGENT DESIGN AND ANALYSIS, 2010, 44 : 15 - 28
  • [9] Preference-based constrained optimization with CP-nets
    Boutilier, C
    Brafman, RI
    Domshlak, C
    Hoos, HH
    Poole, D
    COMPUTATIONAL INTELLIGENCE, 2004, 20 (02) : 137 - 157
  • [10] Approximation Algorithms for Preference Aggregation Using CP-Nets
    Ali, Abu Mohammad Hammad
    Yang, Boting
    Zilles, Sandra
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 9, 2024, : 10433 - 10441