Counting, ranking, and randomly generating CP-Nets

Thomas E. Allen, Judy Goldsmith, Nicholas Mattei

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations


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 languageEnglish
Title of host publicationMultidisciplinary Workshop on Advances in Preference Handling - Papers Presented at the 28th AAAI Conference on Artificial Intelligence, Technical Report
Number of pages6
ISBN (Electronic)9781577356714
StatePublished - 2014
Event28th AAAI Conference on Artificial Intelligence, AAAI 2014 - Quebec City, Canada
Duration: Jul 28 2014 → …

Publication series

NameAAAI Workshop - Technical Report


Conference28th AAAI Conference on Artificial Intelligence, AAAI 2014
CityQuebec City
Period7/28/14 → …

Bibliographical note

Publisher Copyright:
© Copyright 2014, Association for the Advancement of Artificial Intelligence ( All rights reserved.

ASJC Scopus subject areas

  • General Engineering


Dive into the research topics of 'Counting, ranking, and randomly generating CP-Nets'. Together they form a unique fingerprint.

Cite this