The computational complexity of dominance and consistency in CP-Nets

Journal of Artificial Intelligence Research

Volumn 33, Issue , 2008, Pages 403-432

  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

ARTIFICIAL INTELLIGENCE; ELECTRONICS ENGINEERING;

CP-NETS; CYCLIC DEPENDENCIES; DECISION PROBLEMS; DEPENDENCY GRAPHS; OPTIMALITY; PSPACE-COMPLETE; STRIPS PLANNING; STRONG DOMINANCES;

COMPUTATIONAL COMPLEXITY;

EID: 77955853912     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2627     Document Type: Article

References (21)

1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V.,Marchetti-Spaccamela, A., & Protasi,M. (1999). Complexity and Approximation. Combinatorial optimization problems and their approximability properties. Springer Verlag.
2. Boutilier, C., Brafman, R., Domshlak, C., Hoos, H., & Poole, D. (2004a). CP-nets: a tool for representing and reasoning with conditional ceteris paribus statements. Journal of Artificial Intelligence Research, 21, 135-191.
3. Boutilier, C., Brafman, R., Domshlak, C., Hoos, H., & Poole, D. (2004b). Preference-based constrained optimization with CP-nets. Computational Intelligence, 20(2), 137-157.
4. Boutilier, C., Brafman, R., Hoos, H., & Poole, D. (1999). Reasoning with conditional ceteris paribus preference statements. In Proceedings of UAI-99, pp. 71-80.
5. Brafman, R., Domshlak, C., & Shimony, E. (2006). On graphical modeling of preference and importance. Journal of Artificial Intelligence Research, 25, 389-424.
6. Brafman, R., & Dimopoulos, Y. (2004). Extended semantics and optimization algorithms for CPnetworks. Computational Intelligence, 20(2), 218-245.
7. Brafman, R., & Domshlak, C. (2002). Introducing variable importance trade-offs into CP-nets. In Proceedings of UAI-02, pp. 69-76.
8. Brafman, R., & Domshlak, C. (2003). Structure and complexity of planning with unary operators. Journal of Artificial Intelligence Research, 18, 315-439.
9. Brandt, F., Fischer, F., & Harrenstein, P. (2007). The computational complexity of choice sets. In Proceedings of TARK-07, pp. 82-91.
10. Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2), 165-204.
11. Domshlak, C., & Brafman, R. (2002). CP-nets - reasoning and consistency testing. In Proceedings of KR-02, pp. 121-132.
12. Domshlak, C., Prestwich, S., Rossi, F., Venable, K., & Walsh, T. (2006). Hard and soft constraints for reasoning about qualitative conditional preferences. Journal of Heuristics, 12(4/5), 263-285.
13. Domshlak, C., Rossi, F., Venable, K., & Walsh, T. (2003). Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques. In Proceedings of IJCAI-03, pp. 215-220.
14. Goldsmith, J., Lang, J., Truszczyński, M., & Wilson, N. (2005). The computational complexity of dominance and consistency in CP-nets. In Proceedings of IJCAI-05, pp. 144-149.
15. Lang, J. (2004). Logical preference representation and combinatorial vote. Annals of Mathematics and Artificial Intelligence, 42(1), 37-71.
16. Papadimitriou, C. (1994). Computational complexity. Addison-Wesley.
17. Prestwich, S., Rossi, F., Venable, B.,&Walsh, T. (2005). Constraint-based preferential optimization. In Proceedings of AAAI-05, pp. 461-466.
18. Wilson, N. (2004a). Consistency and constrained optimisation for conditional preferences. In Proceedings of ECAI-04, pp. 888-892.
19. Wilson, N. (2004b). Extending CP-nets with stronger conditional preference statements. In Proceedings of AAAI-04, pp. 735-741.
20. Wilson, N. (2006). An efficient upper approximation for conditional preference. In Proceedings of ECAI-06, pp. 472-476.
21. Xia, L., Conitzer, V., & Lang, J. (2008). Voting on multiattribute domains with cyclic preferential dependencies. In Proceedings of AAAI-08, pp. 202-207.