论文信息 - Preference Trees: A Language for Representing and Reasoning about Qualitative Preferences

Preference Trees: A Language for Representing and Reasoning about Qualitative Preferences

We introduce a novel qualitative preference representation language, preference trees , or P-trees . We show that the lan- guage is intuitive to specify preferences over combinatorial domains and it extends existing preference formalisms such as LP-trees , ASO-rules and possibilistic logic . We study rea- soning problems with P-trees and obtain computational com- plexity results.

Miroslaw Truszczynski | Xudong Liu

[1] Didier Dubois,et al. A Brief Overview of Possibilistic Logic , 1991, ECSQARU.

[2] Miroslaw Truszczynski,et al. Answer Set Optimization , 2003, IJCAI.

[3] Yann Chevaleyre,et al. Learning conditionally lexicographic preference relations , 2010, ECAI.

[4] Lirong Xia,et al. Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains , 2012, CP.

[5] Miroslaw Truszczynski,et al. Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers , 2013, ADT.

[6] Mark W. Krentel. The complexity of optimization problems , 1986, STOC '86.

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] Ronen I. Brafman,et al. CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements , 2011, J. Artif. Intell. Res..