Abstract
We show that the dominance problem for CP-nets is P-hard, and that the dominance problem for the more general ase of cyclic CP-nets is PSPACE omplete.
| Original language | English |
|---|---|
| Journal | Dagstuhl Seminar Proceedings |
| Volume | 4421 |
| State | Published - 2005 |
| Event | Algebraic Methods in Computational Complexity 2004 - Wadern, Germany Duration: Oct 10 2004 → Oct 15 2004 |
Bibliographical note
Publisher Copyright:© 2005 Dagstuhl Seminar Proceedings. All rights reserved.
Keywords
- CP-nets
- PSPACE completeness
- Qualitative preferences
- complexity
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Control and Systems Engineering