Representing and reasoning with qualitative preferences: Tools and applications

Ganesh Ram Santhanam, Samik Basu, Vasant Honavar

Research output: Book/ReportBook

Abstract

This book provides a tutorial introduction to modern techniques for representing and reasoning about qualitative preferences with respect to a set of alternatives. The syntax and semantics of several languages for representing preference languages, including CP-nets, TCP-nets, CI-nets, and CP-theories, are reviewed. Some key problems in reasoning about preferences are introduced, including determining whether one alternative is preferred to another, or whether they are equivalent, with respect to a given set of preferences. These tasks can be reduced to model checking in temporal logic. Specifically, an induced preference graph that represents a given set of preferences can be efficiently encoded using a Kripke Structure for Computational Tree Logic (CTL). One can translate preference queries with respect to a set of preferences into an equivalent set of formulae in CTL, such that the CTL formula is satisfied whenever the preference query holds. This allows us to use a model checker to reason about preferences, i.e., answer preference queries, and to obtain a justification as to why a preference query is satisfied (or not) with respect to a set of preferences. This book defines the notions of the equivalence of two sets of preferences, including what it means for one set of preferences to subsume another, and shows how to answer preferential equivalence and subsumption queries using model checking. Furthermore, this book demontrates how to generate alternatives ordered by preference, along with providing ways to deal with inconsistent preference specifications. A description of CRISNER.an open source software implementation of the model checking approach to qualitative preference reasoning in CP-nets, TCP-nets, and CP-theories is included, as well as examples illustrating its use.
Original languageUndefined/Unknown
PublisherMorgan and Claypool Publishers
Number of pages154
Volume10
StatePublished - 2016

Publication series

NameSynthesis Lectures on Artificial Intelligence and Machine Learning
PublisherMorgan Claypool Publishers

Cite this

Santhanam, G. R., Basu, S., & Honavar, V. (2016). Representing and reasoning with qualitative preferences: Tools and applications. (Synthesis Lectures on Artificial Intelligence and Machine Learning). Morgan and Claypool Publishers.
Santhanam, Ganesh Ram ; Basu, Samik ; Honavar, Vasant. / Representing and reasoning with qualitative preferences: Tools and applications. Morgan and Claypool Publishers, 2016. 154 p. (Synthesis Lectures on Artificial Intelligence and Machine Learning).
@book{9d3d0666564246a9bc268e40a733f58b,
title = "Representing and reasoning with qualitative preferences: Tools and applications",
abstract = "This book provides a tutorial introduction to modern techniques for representing and reasoning about qualitative preferences with respect to a set of alternatives. The syntax and semantics of several languages for representing preference languages, including CP-nets, TCP-nets, CI-nets, and CP-theories, are reviewed. Some key problems in reasoning about preferences are introduced, including determining whether one alternative is preferred to another, or whether they are equivalent, with respect to a given set of preferences. These tasks can be reduced to model checking in temporal logic. Specifically, an induced preference graph that represents a given set of preferences can be efficiently encoded using a Kripke Structure for Computational Tree Logic (CTL). One can translate preference queries with respect to a set of preferences into an equivalent set of formulae in CTL, such that the CTL formula is satisfied whenever the preference query holds. This allows us to use a model checker to reason about preferences, i.e., answer preference queries, and to obtain a justification as to why a preference query is satisfied (or not) with respect to a set of preferences. This book defines the notions of the equivalence of two sets of preferences, including what it means for one set of preferences to subsume another, and shows how to answer preferential equivalence and subsumption queries using model checking. Furthermore, this book demontrates how to generate alternatives ordered by preference, along with providing ways to deal with inconsistent preference specifications. A description of CRISNER.an open source software implementation of the model checking approach to qualitative preference reasoning in CP-nets, TCP-nets, and CP-theories is included, as well as examples illustrating its use.",
author = "Santhanam, {Ganesh Ram} and Samik Basu and Vasant Honavar",
year = "2016",
language = "Undefined/Unknown",
volume = "10",
series = "Synthesis Lectures on Artificial Intelligence and Machine Learning",
publisher = "Morgan and Claypool Publishers",
address = "United States",

}

Santhanam, GR, Basu, S & Honavar, V 2016, Representing and reasoning with qualitative preferences: Tools and applications. Synthesis Lectures on Artificial Intelligence and Machine Learning, vol. 10, Morgan and Claypool Publishers.

Representing and reasoning with qualitative preferences: Tools and applications. / Santhanam, Ganesh Ram; Basu, Samik; Honavar, Vasant.

Morgan and Claypool Publishers, 2016. 154 p. (Synthesis Lectures on Artificial Intelligence and Machine Learning).

Research output: Book/ReportBook

TY - BOOK

T1 - Representing and reasoning with qualitative preferences: Tools and applications

AU - Santhanam, Ganesh Ram

AU - Basu, Samik

AU - Honavar, Vasant

PY - 2016

Y1 - 2016

N2 - This book provides a tutorial introduction to modern techniques for representing and reasoning about qualitative preferences with respect to a set of alternatives. The syntax and semantics of several languages for representing preference languages, including CP-nets, TCP-nets, CI-nets, and CP-theories, are reviewed. Some key problems in reasoning about preferences are introduced, including determining whether one alternative is preferred to another, or whether they are equivalent, with respect to a given set of preferences. These tasks can be reduced to model checking in temporal logic. Specifically, an induced preference graph that represents a given set of preferences can be efficiently encoded using a Kripke Structure for Computational Tree Logic (CTL). One can translate preference queries with respect to a set of preferences into an equivalent set of formulae in CTL, such that the CTL formula is satisfied whenever the preference query holds. This allows us to use a model checker to reason about preferences, i.e., answer preference queries, and to obtain a justification as to why a preference query is satisfied (or not) with respect to a set of preferences. This book defines the notions of the equivalence of two sets of preferences, including what it means for one set of preferences to subsume another, and shows how to answer preferential equivalence and subsumption queries using model checking. Furthermore, this book demontrates how to generate alternatives ordered by preference, along with providing ways to deal with inconsistent preference specifications. A description of CRISNER.an open source software implementation of the model checking approach to qualitative preference reasoning in CP-nets, TCP-nets, and CP-theories is included, as well as examples illustrating its use.

AB - This book provides a tutorial introduction to modern techniques for representing and reasoning about qualitative preferences with respect to a set of alternatives. The syntax and semantics of several languages for representing preference languages, including CP-nets, TCP-nets, CI-nets, and CP-theories, are reviewed. Some key problems in reasoning about preferences are introduced, including determining whether one alternative is preferred to another, or whether they are equivalent, with respect to a given set of preferences. These tasks can be reduced to model checking in temporal logic. Specifically, an induced preference graph that represents a given set of preferences can be efficiently encoded using a Kripke Structure for Computational Tree Logic (CTL). One can translate preference queries with respect to a set of preferences into an equivalent set of formulae in CTL, such that the CTL formula is satisfied whenever the preference query holds. This allows us to use a model checker to reason about preferences, i.e., answer preference queries, and to obtain a justification as to why a preference query is satisfied (or not) with respect to a set of preferences. This book defines the notions of the equivalence of two sets of preferences, including what it means for one set of preferences to subsume another, and shows how to answer preferential equivalence and subsumption queries using model checking. Furthermore, this book demontrates how to generate alternatives ordered by preference, along with providing ways to deal with inconsistent preference specifications. A description of CRISNER.an open source software implementation of the model checking approach to qualitative preference reasoning in CP-nets, TCP-nets, and CP-theories is included, as well as examples illustrating its use.

M3 - Book

VL - 10

T3 - Synthesis Lectures on Artificial Intelligence and Machine Learning

BT - Representing and reasoning with qualitative preferences: Tools and applications

PB - Morgan and Claypool Publishers

ER -

Santhanam GR, Basu S, Honavar V. Representing and reasoning with qualitative preferences: Tools and applications. Morgan and Claypool Publishers, 2016. 154 p. (Synthesis Lectures on Artificial Intelligence and Machine Learning).