
The computational complexity of dominance and consistency in CP-nets
Goldsmith, Judy; Lang, Jérôme; Truszczynski, Miroslaw; Wilson, Nic (2005), The computational complexity of dominance and consistency in CP-nets, in Saffiotti, Alessandro, IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30-August 5, 2005., Professional Book Center, p. 144-149
View/ Open
Type
Communication / ConférenceDate
2005Conference country
UNITED KINGDOMBook title
IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30-August 5, 2005.Book author
Saffiotti, AlessandroPublisher
Professional Book Center
ISBN
0938075934
Pages
144-149
Metadata
Show full item recordAbstract (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.Subjects / Keywords
dependency graphs; CP-netsRelated items
Showing items related by title and author.
-
Chevaleyre, Yann; Koriche, Frédéric; Lang, Jérôme; Mengin, Jérôme; Zanuttini, Bruno (2010) Chapitre d'ouvrage
-
Escoffier, Bruno; Lang, Jérôme; Ozturk, Meltem (2008) Communication / Conférence
-
Bouveret, Sylvain; Lang, Jérôme (2005) Communication / Conférence
-
Bouveret, Sylvain; Lang, Jérôme (2008) Article accepté pour publication ou publié
-
Endriss, Ulle; de Haan, Ronald; Lang, Jérôme; Slavkovik, Marija (2020) Article accepté pour publication ou publié