---
title: "Learning Conditional Preference Networks with Queries"
authors:
  - "Frédéric Koriche"
  - "Bruno Zanuttini"
doi: ""
url: "https://ijcai.org/proceedings/2009/319"
pdf: "https://ijcai.org/proceedings/2009/0319.pdf"
venue: "Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence"
year: 2009
pages: "1930-1934"
track: ""
keywords:
---

# Learning Conditional Preference Networks with Queries

Frédéric Koriche, Bruno Zanuttini

*Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence*, pages 1930-1934.

## Abstract

We investigate the problem of eliciting CP-nets in the well-known model of exact learning with equivalence and membership queries. The goal is to identify a preference ordering with a binary-valued CP-net by guiding the user through a sequence of queries. Each example is a dominance test on some pair of outcomes. In this setting, we show that acyclic CP-nets are not learnable with equivalence queries alone, while they are learnable with the help of membership queries if the supplied examples are restricted to swaps. A similar property holds for tree CP-nets with arbitrary examples. In fact, membership queries allow us to provide attribute-efficient algorithms for which the query complexity is only logarithmic in the number of attributes. Such results highlight the utility of this model for eliciting CP-nets in large multi-attribute domains.Frederic Koriche, Bruno Zanuttini