PP-2007-27:
Uckelman, Joel and Endriss, Ulle
(2007)
*Preference Representation with Weighted Goals: Expressivity, Succinctness, Complexity.*
[Report]

Preview |
Text (Full Text)
PP-2007-27.text.pdf Download (135kB) | Preview |

Text (Abstract)
PP-2007-27.abstract.txt Download (1kB) |

## Abstract

Preference Representation with Weighted Goals:

Expressivity, Succinctness, Complexity

Joel Uckelman, Ulle Endriss

Abstract:

The representation of preferences of agents is a central feature in

many AI systems. In particular when the number of alternatives to be

considered may become large, the use of compact preference

representation languages is crucial. The framework of weighted

propositional formulas can be used to define several such

languages. The central idea is to associate numerical weights with

goals specified in terms of propositional formulas, and to compute the

utility value of an alternative as the sum of the weights of the goals

it satisfies. In this paper, we analyze several properties of

languages defined by weighted goals: their expressivity, the relative

succinctness of different sublanguages, and the computational

complexity of finding the best alternative with respect to a given

utility function expressed in terms of weighted goals.

Item Type: | Report |
---|---|

Report Nr: | PP-2007-27 |

Series Name: | Prepublication (PP) Series |

Year: | 2007 |

Uncontrolled Keywords: | weighted formulas; preference representation |

Date Deposited: | 12 Oct 2016 14:36 |

Last Modified: | 12 Oct 2016 14:36 |

URI: | https://eprints.illc.uva.nl/id/eprint/261 |

## Actions (login required)

View Item |