2005/01/01 by Judy Goldsmith, Goldsmith, Judy
Computer Science · #Advanced Database Systems and Queries #CP-nets #Logic, Reasoning, and Knowledge #PSPACE-complete #Preferences #Semantic Web and Ontologies #reductions
paper · doi:10.4230/dagsemproc.04421.4
openalex publication_date 2005/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
CP-nets are a succinct formalism for specifying preferences over a multi-featured domain. A CP-net consists of a directed graph, with nodes representing the features of the domain, and edges indicating conditional preferences. An instance in the domain is an assignment of values to the features. An instance alpha is preferred to an instance beta if there are a sequence of "improving flips" from alpha to beta, where an improving flip changes the value of one feature to a more-preferred value, based on the values of the parents of that feature. We say alpha dominates beta if such a sequence exists. We show that recognizing dominance is PSPACE hard for cyclic CP-nets.