Preference modeling by weighted goals with max aggregation

Open Access
Authors
Publication date 2008
Host editors
  • G. Brewka
  • J. Lang
Book title Principles of knowledge representation and reasoning: Proceedings of the eleventh international conference (KR 2008)
ISBN
  • 9781577353843
Event 11th International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), Sydney, Australia
Pages (from-to) 579-587
Publisher Menlo Park, CA: AAAI Press
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
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.
Document type Conference contribution
Published at http://www.aaai.org/Papers/KR/2008/KR08-057.pdf
Downloads
Permalink to this page
Back