We introduce a novel qualitative preference representation language, preference trees, or P-trees. We show that the language 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 reasoning problems with P-trees and obtain computational complexity results.
|Title of host publication||Multidisciplinary Workshop on Advances in Preference Handling - Papers Presented at the 28th AAAI Conference on Artificial Intelligence, Technical Report|
|Number of pages||6|
|State||Published - 2014|
|Event||28th AAAI Conference on Artificial Intelligence, AAAI 2014 - Quebec City, Canada|
Duration: Jul 28 2014 → …
|Name||AAAI Workshop - Technical Report|
|Conference||28th AAAI Conference on Artificial Intelligence, AAAI 2014|
|Period||7/28/14 → …|
Bibliographical notePublisher Copyright:
© Copyright 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
ASJC Scopus subject areas
- Engineering (all)