PP-2008-28: Uckelman, Joel and Endriss, Ulle (2008) Preference Modeling by Weighted Goals with Max Aggregation. [Report]
Preview |
Text (Full Text)
PP-2008-28.text.pdf Download (206kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
PP-2008-28.abstract.txt Download (720B) |
Abstract
Logic-based preference representation languages are promising
for expressing preferences over combinatorial domains.
Sets of weighted formulas, called goalbases, can be used to
define several such languages. How goalbases are translated
into utility functions---that is, by what aggregation function
this is done---is a crucial component of this type of language.
In this paper, we consider the properties of several goalbase
languages which use max as their aggregation function.
In particular, we examine the expressivity, succinctness and
complexity of such languages.
| Item Type: | Report |
|---|---|
| Report Nr: | PP-2008-28 |
| Series Name: | Prepublication (PP) Series |
| Year: | 2008 |
| Uncontrolled Keywords: | knowledge representation; preferences |
| Depositing User: | Ulle Endriss |
| Date Deposited: | 12 Oct 2016 14:36 |
| Last Modified: | 12 Oct 2016 14:36 |
| URI: | https://eprints.illc.uva.nl/id/eprint/302 |
Actions (login required)
 |
View Item |
