From preference logics to preference languages, and back

Meghyn Bienvenu; Jérôme Lang; Nic Wilson

From preference logics to preference languages, and back

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

Research output: Chapter in Book/Report/Conference proceedings › Conference proceeding › peer-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 language	English
Title of host publication	Principles of Knowledge Representation and Reasoning
Subtitle of host publication	Proceedings of the 12th International Conference, KR 2010
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	414-424
Number of pages	11
ISBN (Print)	9781577354512
Publication status	Published - 2010
Event	12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010 - Toronto, ON, Canada Duration: 9 May 2010 → 13 May 2010

Publication series

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

Conference

Conference	12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010
Country/Territory	Canada
City	Toronto, ON
Period	9/05/10 → 13/05/10

Cite this

Bienvenu, M., Lang, J., & Wilson, N. (2010). From preference logics to preference languages, and back. In Principles of Knowledge Representation and Reasoning: Proceedings of the 12th International Conference, KR 2010 (pp. 414-424). (Proceedings of the International Conference on Knowledge Representation and Reasoning). Institute of Electrical and Electronics Engineers Inc..

Bienvenu, Meghyn ; Lang, Jérôme ; Wilson, Nic. / From preference logics to preference languages, and back. Principles of Knowledge Representation and Reasoning: Proceedings of the 12th International Conference, KR 2010. Institute of Electrical and Electronics Engineers Inc., 2010. pp. 414-424 (Proceedings of the International Conference on Knowledge Representation and Reasoning).

@inproceedings{f43de79fb40c4db487a6e1b8d844abfb,

title = "From preference logics to preference languages, and back",

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.",

author = "Meghyn Bienvenu and J{\'e}r{\^o}me Lang and Nic Wilson",

year = "2010",

language = "English",

isbn = "9781577354512",

series = "Proceedings of the International Conference on Knowledge Representation and Reasoning",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "414--424",

booktitle = "Principles of Knowledge Representation and Reasoning",

address = "United States",

note = "12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010 ; Conference date: 09-05-2010 Through 13-05-2010",

}

Bienvenu, M, Lang, J & Wilson, N 2010, From preference logics to preference languages, and back. in Principles of Knowledge Representation and Reasoning: Proceedings of the 12th International Conference, KR 2010. Proceedings of the International Conference on Knowledge Representation and Reasoning, Institute of Electrical and Electronics Engineers Inc., pp. 414-424, 12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010, Toronto, ON, Canada, 9/05/10.

From preference logics to preference languages, and back. / Bienvenu, Meghyn; Lang, Jérôme; Wilson, Nic.
Principles of Knowledge Representation and Reasoning: Proceedings of the 12th International Conference, KR 2010. Institute of Electrical and Electronics Engineers Inc., 2010. p. 414-424 (Proceedings of the International Conference on Knowledge Representation and Reasoning).

Research output: Chapter in Book/Report/Conference proceedings › Conference proceeding › peer-review

TY - GEN

T1 - From preference logics to preference languages, and back

AU - Bienvenu, Meghyn

AU - Lang, Jérôme

AU - Wilson, Nic

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/79955754695

M3 - Conference proceeding

AN - SCOPUS:79955754695

SN - 9781577354512

T3 - Proceedings of the International Conference on Knowledge Representation and Reasoning

SP - 414

EP - 424

BT - Principles of Knowledge Representation and Reasoning

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010

Y2 - 9 May 2010 through 13 May 2010

ER -

From preference logics to preference languages, and back

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this