Abstract
We introduce a method for generating CP-nets uniformly at random. As CP-nets encode a subset of partial orders, ensuring that we generate samples uniformly at random is not a trivial task. We present algorithms for counting CP-nets, ranking and computing the rank of an arbitrary CP-net for a given number of nodes, and generating a CP-net given its rank. We also show how to generate all CP-nets with a given number of nodes.
| Original language | English |
|---|---|
| Title of host publication | Multidisciplinary Workshop on Advances in Preference Handling - Papers Presented at the 28th AAAI Conference on Artificial Intelligence, Technical Report |
| Pages | 2-7 |
| Number of pages | 6 |
| ISBN (Electronic) | 9781577356714 |
| State | Published - 2014 |
| Event | 28th AAAI Conference on Artificial Intelligence, AAAI 2014 - Quebec City, Canada Duration: Jul 28 2014 → … |
Publication series
| Name | AAAI Workshop - Technical Report |
|---|---|
| Volume | WS-14-10 |
Conference
| Conference | 28th AAAI Conference on Artificial Intelligence, AAAI 2014 |
|---|---|
| Country/Territory | Canada |
| City | Quebec City |
| Period | 7/28/14 → … |
Bibliographical note
Publisher Copyright:© Copyright 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
ASJC Scopus subject areas
- General Engineering