{"type":"ScholarlyArticle","title":"The computational complexity of dominance and consistency in CP-nets","authors":[{"name":"Judy Goldsmith","slug":"judy-goldsmith","given":"Judy","family":"Goldsmith","affiliation":""},{"name":"Jérôme Lang","slug":"jerome-lang","given":"Jérôme","family":"Lang","affiliation":""},{"name":"Miroslaw Truszczynski","slug":"miroslaw-truszczynski","given":"Miroslaw","family":"Truszczynski","affiliation":""},{"name":"Nic Wilson","slug":"nic-wilson","given":"Nic","family":"Wilson","affiliation":""}],"abstract":"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 from STRIPS planning, and thus establish strong connections between both areas.","doi":null,"url":"https://ijcai.org/proceedings/2005/70","pdf":"https://ijcai.org/proceedings/2005/0070.pdf","markdown":"https://ijcai.org/proceedings/2005/70.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/70","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":70,"pages":{"first":144,"last":148},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}