The computational complexity of dominance and consistency in CP-nets

Thumbnail
View/Open
Date
2005
Dewey
Intelligence artificielle
Sujet
dependency graphs; CP-nets
Conference country
UNITED KINGDOM
Book title
IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30-August 5, 2005.
Author
Saffiotti, Alessandro
Publisher
Professional Book Center
Year
2005
ISBN
0938075934
URI
https://basepub.dauphine.fr/handle/123456789/5317
Collections
Metadata
Show full item record
Author
Goldsmith, Judy
Lang, Jérôme
Truszczynski, Miroslaw
Wilson, Nic
Type
Communication / Conférence
Item number of pages
144-149
Abstract (EN)
We investigate the computational complexity oftesting dominance and consistency in CP-nets. Upuntil now, the complexity of dominance has beendetermined only for restricted classes in which thedependency graph of the CP-net is acyclic. However, there are preferences of interest that definecyclic dependency graphs; these are modeled withgeneral CP-nets. We show here that both dominance and consistency testing for general CP-netsare PSPACE-complete. The reductions used in theproofs are from STRIPS planning, and thus establish strong connections between both areas.