Preference modeling by weighted goals with max aggregation, in:

DMCA

Preference modeling by weighted goals with max aggregation, in: (2008)

Cached

Download Links

by Joel Uckelman

Venue:	Proc. 11th International Conference on Principles of Knowledge Representation and Reasoning (KR-2008),
Citations:	3 - 3 self

BibTeX

@INPROCEEDINGS{Uckelman08preferencemodeling,
    author = {Joel Uckelman},
    title = {Preference modeling by weighted goals with max aggregation, in:},
    booktitle = {Proc. 11th International Conference on Principles of Knowledge Representation and Reasoning (KR-2008),},
    year = {2008},
    pages = {579--587},
    publisher = {AAAI Press,}
}

OpenURL

Abstract

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.

DMCA