More-or-Less CP-Networks

Preferences play an important role in our everyday lives. CP-networks, or CP-nets in short, are graphical models for representing conditional qualitative preferences under ceteris paribus ("all else being equal") assumptions. Despite their intuitive nature and rich representation, dominanc...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Yaman, Fusun, desJardins, Marie
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 20.06.2012
Subjects
Algorithms
Complexity
Graphical representations
Prunes
Online AccessGet full text

Cover

More Information
Summary:Preferences play an important role in our everyday lives. CP-networks, or CP-nets in short, are graphical models for representing conditional qualitative preferences under ceteris paribus ("all else being equal") assumptions. Despite their intuitive nature and rich representation, dominance testing with CP-nets is computationally complex, even when the CP-nets are restricted to binary-valued preferences. Tractable algorithms exist for binary CP-nets, but these algorithms are incomplete for multi-valued CPnets. In this paper, we identify a class of multivalued CP-nets, which we call more-or-less CPnets, that have the same computational complexity as binary CP-nets. More-or-less CP-nets exploit the monotonicity of the attribute values and use intervals to aggregate values that induce similar preferences. We then present a search control rule for dominance testing that effectively prunes the search space while preserving completeness.
ISSN:2331-8422