The computational complexity of dominance and consistency in CP-nets

Thumbnail
Ouvrir
Date
2005
Indexation documentaire
Intelligence artificielle
Subject
dependency graphs; CP-nets
Pays du colloque
UNITED KINGDOM
Titre de l'ouvrage
IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30-August 5, 2005.
Auteur
Saffiotti, Alessandro
Nom de l'éditeur
Professional Book Center
Année
2005
ISBN
0938075934
URI
https://basepub.dauphine.fr/handle/123456789/5317
Collections
Métadonnées
Afficher la notice complète
Auteur
Goldsmith, Judy
Lang, Jérôme
Truszczynski, Miroslaw
Wilson, Nic
Type
Communication / Conférence
Nombre de pages du document
144-149
Résumé en anglais
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.