From preference logics to preference languages, and back

  • Meghyn Bienvenu
  • , Jérôme Lang
  • , Nic Wilson

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research have had little interaction. This paper contributes to the bridging of these areas. We start by constructing a "prototypical" preference logic, which combines features of existing preference logics, and then we show that many well-known preference languages, such as CP-nets and its extensions, are natural fragments of it. After establishing useful characterizations of dominance and consistency in our logic, we study the complexity of satisfiability in the general case as well as for meaningful fragments, and we study the expressive power as well as the relative succinctness of some of these fragments.

Original languageEnglish
Title of host publicationPrinciples of Knowledge Representation and Reasoning
Subtitle of host publicationProceedings of the 12th International Conference, KR 2010
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages414-424
Number of pages11
ISBN (Print)9781577354512
Publication statusPublished - 2010
Event12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010 - Toronto, ON, Canada
Duration: 9 May 201013 May 2010

Publication series

NameProceedings of the International Conference on Knowledge Representation and Reasoning
ISSN (Print)2334-1025
ISSN (Electronic)2334-1033

Conference

Conference12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010
Country/TerritoryCanada
CityToronto, ON
Period9/05/1013/05/10

Fingerprint

Dive into the research topics of 'From preference logics to preference languages, and back'. Together they form a unique fingerprint.

Cite this