The computational complexity of dominance and consistency in CP-nets

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 144-149

  Goldsmith, Judy ^a   Lang, Jérôme ^b   Truszczyński, Miroslaw ^a   Wilson, Nic ^c  

^a UNIVERSITY OF KENTUCKY   (United States)

^b UNIVERSITÉ PAUL SABATIER   (France)

^c UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

CP-NETS; CYCLIC DEPENDENCIES; DEPENDENCY GRAPHS; PSPACE-COMPLETE; STRIPS PLANNING;

ARTIFICIAL INTELLIGENCE; PROGRAM PROCESSORS;

COMPUTATIONAL COMPLEXITY;

EID: 84880740195     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. C. Boutilier, R. I. Brafman, H. H. Hoos, and D. Poole. Reasoning with conditional ceteris paribus preference statements. In Proceedings of UAI99, pages 71-80, 1999.
2. C. Boutilier, R. Brafman, C. Domshlak, H. Hoos, and D. Poole. CP-nets: a tool for representing and reasoning with conditional ceteris paribus statements. JAIR, 21:135-191, 2004. (Pubitemid 41525900)
3. C. Boutilier, R. I. Brafman, C. Domshlak, H. Hoos, and D. Poole. Preference-based constrained optimization with CP-nets. Computational Intelligence, 20(2):137-157, 2004.
4. R. Brafman and Y. Dimopoulos. Extended semantics and optimization algorithms for CP-networks. Computational Intelligence,20(2):218-245, 2004.
5. R. Brafman and C. Domshlak. Introducing variable importance trade-offs into CPnets. In Proceedings of UAI-02, pages 69-76, 2002.
6. R. Brafman and C. Domshlak. Structure and complexity of planning with unary operators. JAIR, 18:315-439, 2003.
7. T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence Journal, 69(1-2):165-204, 1994.
8. C. Domshlak and R. I. Brafman. CP-nets - reasoning and consistency testing. In Proceedings of KR2002, pages 121-132, 2002.
9. C. Domshlak, F. Rossi, K. B. Venable, and T. Walsh. Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques. In Proceedings of IJCAI-03, pages 215-220, 2003.
10. J. Lang. Logical preference representation and combinatorial vote. Annals of Mathematics and Artificial Intelligence, 42(1):37-71, 2004.
11. Ch. Papadimitriou. Computational complexity. Addison-Wesley, 1994.
12. N. Wilson. Consistency and constrained optimisation for conditional preferences. In Proceedings of ECAI-04, pages 888-892, 2004.
13. N. Wilson. Extending CP-nets with stronger conditional preference statements. In Proceedings of AAAI-04, pages 735-741, 2004.