The computational complexity of dominance and consistency in CP-Nets

Show simple item record Goldsmith, Judy Lang, Jerome Truszczynski, Miroslaw Wilson, Nic 2013-05-13T13:57:31Z 2013-05-13T13:57:31Z 2008 2008-03
dc.identifier.citation Goldsmith, J, Lang, J, Truszczynski, M, Wilson, N; (2008) 'The Computational Complexity of Dominance and Consistency In Cp-Nets'. Journal of Artificial Intelligence Research, 33 :403-432. doi: 10.1613/jair.2627 en
dc.identifier.volume 33 en
dc.identifier.startpage 403 en
dc.identifier.endpage 432 en
dc.identifier.issn 1076-9757
dc.identifier.doi 10.1613/jair.2627
dc.description.abstract We investigate the computational complexity of testing dominance and consistency in CP-nets. Previously, the complexity of dominance has been determined 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. In our main results, we show here that both dominance and consistency for general CP-nets are PSPACE-complete. We then consider the concept of strong dominance, dominance equivalence and dominance incomparability, and several notions of optimality, and identify the complexity of the corresponding decision problems. The reductions used in the proofs are from STRIPS planning, and thus reinforce the earlier established connections between both areas.. en
dc.description.sponsorship Science Foundation Ireland (00/PI.1/C075); Science Foundation Ireland (05/IN/I886) en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher Association for the Advancement of Artificial Intelligence (AAAI) en
dc.rights © Copyright 1993-2009 AI Access Foundation, Inc. The AAAI electronic version of this article can be found at en
dc.subject CP-nets en
dc.subject PSPACE-complete en
dc.subject Strong dominance en
dc.subject Dominance equivalence en
dc.subject Dominance incomparability en
dc.subject STRIPS planning en
dc.subject.lcsh Computer science. en
dc.title The computational complexity of dominance and consistency in CP-Nets en
dc.type Article (peer-reviewed) en
dc.internal.authorurl en
dc.internal.authorcontactother Nic Wilson, Computer Science, University College Cork, Cork, Ireland. +353-21-490-3000 Email: en
dc.internal.availability Full text available en 2012-12-20T17:40:33Z
dc.description.version Published Version en
dc.internal.rssid 722001
dc.internal.wokid 174968320
dc.contributor.funder Science Foundation Ireland en
dc.description.status Peer reviewed en
dc.identifier.journaltitle Journal of Artificial Intelligence Research en
dc.internal.copyrightchecked No. CORA - ROMEO en
dc.internal.licenseacceptance Yes en
dc.internal.IRISemailaddress en
dc.relation.project info:eu-repo/grantAgreement/SFI/SFI Principal Investigator Programme (PI)/00/PI.1/C075/IE/Constraint Computation: Automation and Application/
dc.relation.project info:eu-repo/grantAgreement/SFI/SFI Technology and Innovation Development Award (TIDA)/05/IN.1/I886 TIDA 09/IE/Costraint Baset Energy Cost Efficient Scheduling/

Files in this item

This item appears in the following Collection(s)

Show simple item record

This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement