• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Expressive Power of Weighted Propositional Formulas for Cardinal Preference Modelling

Chevaleyre, Yann; Endriss, Ulle; Lang, Jérôme (2006), Expressive Power of Weighted Propositional Formulas for Cardinal Preference Modelling, in Welty, Christopher, Principles of Knowledge Representation and Reasoning: Proceedings of the Tenth International Conference (KR-06), AAAI Press : Palo Alto (USA), p. 145-152

Type
Communication / Conférence
Date
2006
Conference country
UNITED KINGDOM
Book title
Principles of Knowledge Representation and Reasoning: Proceedings of the Tenth International Conference (KR-06)
Book author
Welty, Christopher
Publisher
AAAI Press
Published in
Palo Alto (USA)
ISBN
978-1-57735-271-6
Pages
145-152
Metadata
Show full item record
Author(s)
Chevaleyre, Yann
Endriss, Ulle
Lang, Jérôme
Abstract (EN)
As proposed in various places, a set of propositional formulas, each associated with a numerical weight, can be used to model the preferences of an agent in combinatorial domains. If the range of possible choices can be represented by the set of possible assignments of propositional symbols to truth values, then the utility of an assignment is given by the sum of the weights of the formulas it satisfies. Our aim in this paper is twofold: (1) to establish correspondences between certain types of weighted formulas and well-known classes of utility functions (such as monotonic, concave or k-additive functions); and (2) to obtain results on the comparative succinctness of different types of weighted formulas for representing the same class of utility functions.
Subjects / Keywords
expressive power comparative succinctness; computational complexity; logic-based languages; Preference representation

Related items

Showing items related by title and author.

  • Thumbnail
    Representing Utility Functions via Weighted Goals 
    Chevaleyre, Yann; Endriss, Ulle; Lang, Jérôme; Uckelman, Joel (2009) Article accepté pour publication ou publié
  • Thumbnail
    Preference Handling in Combinatorial Domains: From AI to Social Choice 
    Chevaleyre, Yann; Endriss, Ulle; Lang, Jérôme; Maudet, Nicolas (2008) Article accepté pour publication ou publié
  • Thumbnail
    Negotiating over small bundles of resources 
    Chevaleyre, Yann; Endriss, Ulle; Lang, Jérôme; Maudet, Nicolas (2005) Communication / Conférence
  • Thumbnail
    Issues in Multiagent Resource Allocation 
    Chevaleyre, Yann; Dunne, Paul; Endriss, Ulle; Lang, Jérôme; Lemaître, Michel; Maudet, Nicolas; Padget, Julian; Phelps, Steve; Rodríguez-Aguilar, Juan A.; Sousa, Paulo (2006) Article accepté pour publication ou publié
  • Thumbnail
    A Short Introduction to Computational Social Choice 
    Chevaleyre, Yann; Endriss, Ulle; Lang, Jérôme; Maudet, Nicolas (2007) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo