메뉴 건너뛰기




Volumn , Issue , 2004, Pages 735-741

Extending CP-nets with stronger conditional preference statements

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; NETWORK PROTOCOLS; PROBLEM SOLVING; SEMANTICS;

EID: 9444280808     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (121)

References (8)
  • 1
    • 9444247347 scopus 로고    scopus 로고
    • CP-nets: A tool for reasoning with conditional ceteris paribus preference statements
    • To appear in
    • Boutilier, C.; Brafman, R. I.; Domshlak, C.; Hoos, H.; and Poole, D. CP-nets: A tool for reasoning with conditional ceteris paribus preference statements. To appear in JAIR.
    • JAIR
    • Boutilier, C.1    Brafman, R.I.2    Domshlak, C.3    Hoos, H.4    Poole, D.5
  • 6
    • 84880847646 scopus 로고    scopus 로고
    • Reasoning about soft constraints and conditional preferences: Complexity results and approximation techniques
    • Domshlak, C.; Rossi, F.; Venable, K.; and Walsh, T. 2003. Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques. In Proc. IJCAI03.
    • (2003) Proc. IJCAI03
    • Domshlak, C.1    Rossi, F.2    Venable, K.3    Walsh, T.4


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