메뉴 건너뛰기




Volumn 4724 LNAI, Issue , 2007, Pages 660-671

Relaxing ceteris paribus preferences with partially ordered priorities

Author keywords

Conditional preferences; Logical representation; Partial order; Priority; Reasoning about preferences

Indexed keywords

LOGIC PROGRAMMING; POLYNOMIALS; SIGNAL ENCODING;

EID: 38049136677     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75256-1_58     Document Type: Conference Paper
Times cited : (8)

References (15)
  • 1
    • 1842864006 scopus 로고    scopus 로고
    • Reasoning with partially ordered information in a possibilistic logic Framework
    • Benferhat, S., Lagrue, S., Papini, O.: Reasoning with partially ordered information in a possibilistic logic Framework. Fuzzy Sets and Systems 144(1), 25-41 (2004)
    • (2004) Fuzzy Sets and Systems , vol.144 , Issue.1 , pp. 25-41
    • Benferhat, S.1    Lagrue, S.2    Papini, O.3
  • 2
    • 4344559610 scopus 로고    scopus 로고
    • CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements
    • Boutilier, C., Brafman, R., Domshlak, C., Hoos, H., Poole, D.: CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. JAIR 21, 135-191 (2004)
    • (2004) JAIR , vol.21 , pp. 135-191
    • Boutilier, C.1    Brafman, R.2    Domshlak, C.3    Hoos, H.4    Poole, D.5
  • 3
    • 2442668142 scopus 로고    scopus 로고
    • A new look at the semantics and optimization methods of CP-networks
    • Brafman, R., Dimopoulos, Y.: A new look at the semantics and optimization methods of CP-networks. Computational Intelligence 20(2), 137-157 (2004)
    • (2004) Computational Intelligence , vol.20 , Issue.2 , pp. 137-157
    • Brafman, R.1    Dimopoulos, Y.2
  • 4
    • 38049179297 scopus 로고    scopus 로고
    • Brafman, R.I., Domshlak, C.: Introducing variables importance tradeoffs into CP-Nets. In: UAI'02, pp. 69-76 (2002)
    • Brafman, R.I., Domshlak, C.: Introducing variables importance tradeoffs into CP-Nets. In: UAI'02, pp. 69-76 (2002)
  • 5
    • 0000342173 scopus 로고
    • Preferred subtheories: An extended logical framework for default reasoning
    • Brewka, G.: Preferred subtheories: an extended logical framework for default reasoning. In: IJCAI'89, pp. 1043-1048 (1989)
    • (1989) IJCAI'89 , pp. 1043-1048
    • Brewka, G.1
  • 7
    • 38049108530 scopus 로고    scopus 로고
    • Coste-Marquis, S., Lang, J., Liberatore, P., Marquis, P.: Expressive power and succinctness of propositional languages for preference representation. In: KR'04, pp. 203-212 (2004)
    • Coste-Marquis, S., Lang, J., Liberatore, P., Marquis, P.: Expressive power and succinctness of propositional languages for preference representation. In: KR'04, pp. 203-212 (2004)
  • 9
    • 84880847646 scopus 로고    scopus 로고
    • Reasoning about soft constraints and conditional preferences
    • Domshlak, C., Venable, B., Rossi, F., Walsh, T.: Reasoning about soft constraints and conditional preferences. In: IJCAI'03, pp. 215-220 (2003)
    • (2003) IJCAI'03 , pp. 215-220
    • Domshlak, C.1    Venable, B.2    Rossi, F.3    Walsh, T.4
  • 10
    • 38049105965 scopus 로고    scopus 로고
    • CP-nets and possibilistic logic: Two approaches to preference modeling. Steps towards a comparison
    • Dubois, D., Kaci, S., Prade, H.: CP-nets and possibilistic logic: Two approaches to preference modeling. Steps towards a comparison. In: IJCAI'05 Workshop on Preferences (2005)
    • (2005) IJCAI'05 Workshop on Preferences
    • Dubois, D.1    Kaci, S.2    Prade, H.3
  • 11
    • 0010288660 scopus 로고    scopus 로고
    • Defining relative likelihood in partially-ordered preferential structure
    • Halpern, J.: Defining relative likelihood in partially-ordered preferential structure. JAIR 7, 1-24 (1997)
    • (1997) JAIR , vol.7 , pp. 1-24
    • Halpern, J.1
  • 12
    • 3843100297 scopus 로고    scopus 로고
    • Logical preference representations and combinatorial vote. Annals on Mathematics and Artificial
    • Lang, J.: Logical preference representations and combinatorial vote. Annals on Mathematics and Artificial Intelligence 42(1-3), 37-71 (2004)
    • (2004) Intelligence , vol.42 , Issue.1-3 , pp. 37-71
    • Lang, J.1
  • 13
    • 0036926279 scopus 로고    scopus 로고
    • Efficient Utility Functions for Ceteris Paribus Preferences
    • McGeachie, M., Doyle, J.: Efficient Utility Functions for Ceteris Paribus Preferences. In: AAAI'02, pp. 279-284 (2002)
    • (2002) AAAI'02 , pp. 279-284
    • McGeachie, M.1    Doyle, J.2
  • 14
    • 9444280808 scopus 로고    scopus 로고
    • Extending CP-nets with stronger conditional preference statements
    • Wilson, N.: Extending CP-nets with stronger conditional preference statements. In: AAAI'04, pp. 735-741 (2004)
    • (2004) AAAI'04 , pp. 735-741
    • Wilson, N.1
  • 15
    • 38049129988 scopus 로고    scopus 로고
    • An efficient upper approximation for conditional preference
    • Wilson, N.: An efficient upper approximation for conditional preference. In: ECAI'06, pp. 472-476 (2006)
    • (2006) ECAI'06 , pp. 472-476
    • Wilson, N.1


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