The computational complexity of dominance and consistency in CP-Nets

Simple item page
dc.contributor.authorGoldsmith, Judy
dc.contributor.authorLang, Jerome
dc.contributor.authorTruszczynski, Miroslaw
dc.contributor.authorWilson, Nic
dc.contributor.funderScience Foundation Irelanden
dc.date.accessioned2013-05-13T13:57:31Z
dc.date.available2013-05-13T13:57:31Z
dc.date.copyright2008
dc.date.issued2008-03
dc.date.updated2012-12-20T17:40:33Z
dc.description.abstractWe 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.sponsorshipScience Foundation Ireland (00/PI.1/C075); Science Foundation Ireland (05/IN/I886)en
dc.description.statusPeer revieweden
dc.description.versionPublished Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationGoldsmith, 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.2627en
dc.identifier.doi10.1613/jair.2627
dc.identifier.endpage432en
dc.identifier.issn1076-9757
dc.identifier.journaltitleJournal of Artificial Intelligence Researchen
dc.identifier.startpage403en
dc.identifier.urihttps://hdl.handle.net/10468/1117
dc.identifier.volume33en
dc.language.isoenen
dc.publisherAssociation for the Advancement of Artificial Intelligence (AAAI)en
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Principal Investigator Programme (PI)/00/PI.1/C075/IE/Constraint Computation: Automation and Application/
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Technology and Innovation Development Award (TIDA)/05/IN.1/I886 TIDA 09/IE/Costraint Baset Energy Cost Efficient Scheduling/
dc.relation.urihttp://www.jair.org/vol/vol33.html
dc.rights© Copyright 1993-2009 AI Access Foundation, Inc. The AAAI electronic version of this article can be found at http://www.jair.org/vol/vol33.htmlen
dc.subjectCP-netsen
dc.subjectPSPACE-completeen
dc.subjectStrong dominanceen
dc.subjectDominance equivalenceen
dc.subjectDominance incomparabilityen
dc.subjectSTRIPS planningen
dc.subject.lcshComputer science.en
dc.titleThe computational complexity of dominance and consistency in CP-Netsen
dc.typeArticle (peer-reviewed)en
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CPSPACE-jair.pdf
Size:
226.29 KB
Format:
Adobe Portable Document Format
Description:
Published Version
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
2.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science - Journal Articles
Insight Centre for Data Analytics - Journal Articles