메뉴 건너뛰기




Volumn 175, Issue 7-8, 2011, Pages 1053-1091

Computational techniques for a simple theory of conditional preferences

Author keywords

Ceteris paribus preferences; Comparative preferences; Conditional preferences; Constrained optimisation; CP nets; Lexicographic preferences; TCP nets

Indexed keywords

CETERIS PARIBUS PREFERENCES; COMPARATIVE PREFERENCES; CONDITIONAL PREFERENCES; CP-NETS; LEXICOGRAPHIC PREFERENCES; OPTIMISATIONS; TCP-NETS;

EID: 79954822319     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2010.11.018     Document Type: Article
Times cited : (32)

References (35)
  • 2
    • 0003288280 scopus 로고    scopus 로고
    • UCP-networks: A directed graphical representation of conditional utilities
    • C. Boutilier, F. Bacchus, R. Brafman, UCP-networks: A directed graphical representation of conditional utilities, in: Proceedings of UAI 2001, 2001, pp. 56-64.
    • (2001) Proceedings of UAI 2001 , pp. 56-64
    • Boutilier, C.1    Bacchus, F.2    Brafman, R.3
  • 6
    • 27344454326 scopus 로고    scopus 로고
    • Introducing variable importance trade-offs into CP-nets
    • R. Brafman, C. Domshlak, Introducing variable importance trade-offs into CP-nets, in: Proceedings of UAI 2002, 2002, pp. 69-76.
    • (2002) Proceedings of UAI 2002 , pp. 69-76
    • Brafman, R.1    Domshlak, C.2
  • 7
    • 37149009897 scopus 로고    scopus 로고
    • Graphically structured value-function compilation
    • DOI 10.1016/j.artint.2007.07.002, PII S0004370207001130
    • R. Brafman, and C. Domshlak Graphically structured value-function compilation Artificial Intelligence 172 2008 325 349 (Pubitemid 350256735)
    • (2008) Artificial Intelligence , vol.172 , Issue.2-3 , pp. 325-349
    • Brafman, R.I.1    Domshlak, C.2
  • 9
    • 2442589725 scopus 로고    scopus 로고
    • Extended semantics and optimization algorithms for CP-networks
    • R.I. Brafman, and Y. Dimopoulos Extended semantics and optimization algorithms for CP-networks Computational Intelligence 20 2 2004 218 245
    • (2004) Computational Intelligence , vol.20 , Issue.2 , pp. 218-245
    • Brafman, R.I.1    Dimopoulos, Y.2
  • 10
    • 9144248527 scopus 로고    scopus 로고
    • Qualitative decision making in adaptive presentation of structured information
    • R.I. Brafman, C. Domshlak, and S.E. Shimony Qualitative decision making in adaptive presentation of structured information ACM Transactions on Information Systems 22 4 2004 503 539
    • (2004) ACM Transactions on Information Systems , vol.22 , Issue.4 , pp. 503-539
    • Brafman, R.I.1    Domshlak, C.2    Shimony, S.E.3
  • 12
    • 2442630828 scopus 로고    scopus 로고
    • CP-nets-reasoning and consistency testing
    • C. Domshlak, R.I. Brafman, CP-nets-reasoning and consistency testing, in: Proceedings of KR 2002, 2002, pp. 121-132.
    • (2002) Proceedings of KR 2002 , pp. 121-132
    • Domshlak, C.1    Brafman, R.I.2
  • 13
    • 33646598015 scopus 로고    scopus 로고
    • Hard and soft constraints for reasoning about qualitative conditional preferences
    • DOI 10.1007/s10732-006-7071-x, Preferences and Soft Constraints
    • C. Domshlak, S. Prestwich, F. Rossi, K.B. Venable, and T. Walsh Hard and soft constraints for reasoning about qualitative conditional preferences Journal of Heuristics 12 4-5 2006 263 285 (Pubitemid 43724146)
    • (2006) Journal of Heuristics , vol.12 , Issue.4-5 , pp. 263-285
    • Domshlak, C.1    Prestwich, S.2    Rossi, F.3    Venable, K.B.4    Walsh, T.5
  • 14
    • 84880847646 scopus 로고    scopus 로고
    • Reasoning about soft constraints and conditional preferences: Complexity results and approximation techniques
    • C. Domshlak, F. Rossi, K. Venable, T. Walsh, Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques, in: Proceedings of IJCAI 2003, 2003, pp. 215-220.
    • (2003) Proceedings of IJCAI 2003 , pp. 215-220
    • Domshlak, C.1    Rossi, F.2    Venable, K.3    Walsh, T.4
  • 16
    • 74849127730 scopus 로고    scopus 로고
    • Lexicographically-ordered constraint satisfaction problems
    • E. Freuder, R. Heffernan, R. Wallace, and N. Wilson Lexicographically- ordered constraint satisfaction problems Constraints 171 1 2010 3 25
    • (2010) Constraints , vol.171 , Issue.1 , pp. 3-25
    • Freuder, E.1    Heffernan, R.2    Wallace, R.3    Wilson, N.4
  • 17
    • 84880740195 scopus 로고    scopus 로고
    • The computational complexity of dominance and consistency in CP-nets
    • J. Goldsmith, J. Lang, M. Truszczyński, N. Wilson, The computational complexity of dominance and consistency in CP-nets, in: Proceedings of IJCAI 2005, 2005, pp. 144-149.
    • (2005) Proceedings of IJCAI 2005 , pp. 144-149
    • Goldsmith, J.1
  • 19
  • 22
    • 38049136677 scopus 로고    scopus 로고
    • Relaxing ceteris paribus preferences with partially ordered priorities
    • S. Kaci, H. Prade, Relaxing ceteris paribus preferences with partially ordered priorities, in: Proceedings of ECSQARU 2007, 2007, pp. 660-671.
    • (2007) Proceedings of ECSQARU 2007 , pp. 660-671
    • Kaci, S.1    Prade, H.2
  • 23
    • 9444237735 scopus 로고    scopus 로고
    • From preference representation to combinatorial vote
    • J. Lang, From preference representation to combinatorial vote, in: Proceedings of KR 2002, 2002, pp. 277-288.
    • (2002) Proceedings of KR 2002 , pp. 277-288
    • Lang, J.1
  • 24
    • 3843100297 scopus 로고    scopus 로고
    • Logical preference representation and combinatorial vote
    • DOI 10.1023/B:AMAI.0000034522.25580.09
    • J. Lang Logical preference representation and combinatorial vote Annals of Mathematics and Artificial Intelligence 42 1 2004 37 71 (Pubitemid 39046778)
    • (2004) Annals of Mathematics and Artificial Intelligence , vol.42 , Issue.1-3 , pp. 37-71
    • Lang, J.1
  • 25
    • 0000815146 scopus 로고
    • Sur lextension de lordre partiel
    • E. Marczewski Sur lextension de lordre partiel Fundamenta Mathematicae 16 1930 386 389
    • (1930) Fundamenta Mathematicae , vol.16 , pp. 386-389
    • Marczewski, E.1
  • 26
    • 0036926279 scopus 로고    scopus 로고
    • Efficient utility functions for ceteris paribus preferences
    • M. McGeachie, J. Doyle, Efficient utility functions for ceteris paribus preferences, in: Proceedings of AAAI 2002, 2002, pp. 279-284.
    • (2002) Proceedings of AAAI 2002 , pp. 279-284
    • McGeachie, M.1    Doyle, J.2
  • 27
    • 2442539195 scopus 로고    scopus 로고
    • Utility functions for ceteris paribus preferences
    • M. McGeachie, and J. Doyle Utility functions for ceteris paribus preferences Computational Intelligence 20 2 2004 158 217
    • (2004) Computational Intelligence , vol.20 , Issue.2 , pp. 158-217
    • McGeachie, M.1    Doyle, J.2
  • 28
    • 57849119269 scopus 로고    scopus 로고
    • Everything else being equal: A modal logic for ceteris paribus preferences
    • J. van Benthem, P. Girard, and O. Roy Everything else being equal: A modal logic for ceteris paribus preferences Journal of Philosophical Logic 38 1 2009 83 125
    • (2009) Journal of Philosophical Logic , vol.38 , Issue.1 , pp. 83-125
    • Van Benthem, J.1    Girard, P.2    Roy, O.3
  • 30
    • 0542426618 scopus 로고
    • The logic of preference reconsidered
    • G.H. von Wright The logic of preference reconsidered Theory and Decision 3 1972 140 169
    • (1972) Theory and Decision , vol.3 , pp. 140-169
    • Von Wright, G.H.1
  • 31
    • 85017365143 scopus 로고    scopus 로고
    • Consistency and constrained optimisation for conditional preferences
    • N. Wilson, Consistency and constrained optimisation for conditional preferences, in: Proceedings of ECAI 2004, 2004, pp. 888-892.
    • (2004) Proceedings of ECAI 2004 , pp. 888-892
    • Wilson, N.1
  • 32
    • 9444280808 scopus 로고    scopus 로고
    • Extending CP-nets with stronger conditional preference statements
    • N. Wilson, Extending CP-nets with stronger conditional preference statements, in: Proceedings of AAAI 2004, 2004, pp. 735-741.
    • (2004) Proceedings of AAAI 2004 , pp. 735-741
    • Wilson, N.1
  • 33
    • 38049129988 scopus 로고    scopus 로고
    • An efficient upper approximation for conditional preference
    • N. Wilson, An efficient upper approximation for conditional preference, in: Proceedings of ECAI 2006, 2006, pp. 472-476.
    • (2006) Proceedings of ECAI 2006 , pp. 472-476
    • Wilson, N.1
  • 34
    • 77955886902 scopus 로고    scopus 로고
    • Efficient inference for expressive comparative preference languages
    • N. Wilson, Efficient inference for expressive comparative preference languages, in: Proceedings of IJCAI 2009, 2009, pp. 961-966.
    • (2009) Proceedings of IJCAI 2009 , pp. 961-966
    • Wilson, N.1
  • 35
    • 57749209848 scopus 로고    scopus 로고
    • Voting on multiattribute domains with cyclic preferential dependencies
    • L. Xia, V. Conitzer, J. Lang, Voting on multiattribute domains with cyclic preferential dependencies, in: Proceedings of AAAI 2008, 2008, pp. 202-207.
    • (2008) Proceedings of AAAI 2008 , pp. 202-207
    • Xia, L.1    Conitzer, V.2    Lang, J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.