• DOI:10.1613/jair.2627
Corpus ID: 1626851

The computational complexity of dominance and consistency in CP-nets

@inproceedings{Goldsmith2005TheCC,
  title={The computational complexity of dominance and consistency in CP-nets},
  author={J. Goldsmith and J. Lang and M. Truszczynski and N. Wilson},
  booktitle={IJCAI},
  year={2005}
}

J. Goldsmith, J. Lang, +1 author N. Wilson

Published in IJCAI 2005

Computer Science, Mathematics

We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted classes in which the dependency graph of the CP-net is acyclic. However, there are preferences of interest that define cyclic dependency graphs; these are modeled with general CP-nets. We show here that both dominance and consistency testing for general CP-nets are PSPACE-complete. The reductions used in the proofs are… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed