메뉴 건너뛰기




Volumn 12, Issue 4-5, 2006, Pages 263-285

Hard and soft constraints for reasoning about qualitative conditional preferences

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; DATA HANDLING; OPTIMIZATION; REAL TIME SYSTEMS; SEMANTICS;

EID: 33646598015     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-006-7071-x     Document Type: Conference Paper
Times cited : (34)

References (24)
  • 2
    • 0031095278 scopus 로고    scopus 로고
    • Semiring-based constraint solving and optimization
    • Bistarelli, S., U. Montanari, and F. Rossi. (1997). "Semiring-Based Constraint Solving and Optimization." Journal of the ACM 44(2), 201-236.
    • (1997) Journal of the ACM , vol.44 , Issue.2 , pp. 201-236
    • Bistarelli, S.1    Montanari, U.2    Rossi, F.3
  • 3
    • 0002657285 scopus 로고    scopus 로고
    • Reasoning with conditional ceteris paribus preference statements
    • Boutilier, C., R. Brafman, H. Hoos, and D. Poole. (1999). "Reasoning with Conditional Ceteris Paribus Preference Statements." In Proc. of UAI pp. 71-80.
    • (1999) Proc. of UAI , pp. 71-80
    • Boutilier, C.1    Brafman, R.2    Hoos, H.3    Poole, D.4
  • 4
    • 0003288280 scopus 로고    scopus 로고
    • UCP-networks: A directed graphical representation of conditional utilities
    • Boutilier, C., F. Bacchus, and R.I. Brafman. (2001). "UCP-Networks: A Directed Graphical Representation of Conditional Utilities." In Proc. of UAI, pp. 56-64.
    • (2001) Proc. of UAI , pp. 56-64
    • Boutilier, C.1    Bacchus, F.2    Brafman, R.I.3
  • 7
    • 2442589725 scopus 로고    scopus 로고
    • Extended semantics and optimization algorithms for CP-networks
    • Brafman, R. and Y. Dimopoulos. (2004). "Extended Semantics and Optimization Algorithms for CP-Networks." Computational Intelligence 20(2), 218-245.
    • (2004) Computational Intelligence , vol.20 , Issue.2 , pp. 218-245
    • Brafman, R.1    Dimopoulos, Y.2
  • 8
    • 2442630828 scopus 로고    scopus 로고
    • CP-Nets - Reasoning and consistency testing
    • Domshlak, C. and R. Brafman. (2002). "CP-Nets - Reasoning and Consistency Testing." In Proc. of KR, pp. 121-132.
    • (2002) Proc. of KR , pp. 121-132
    • Domshlak, C.1    Brafman, R.2
  • 9
    • 84880847646 scopus 로고    scopus 로고
    • Reasoning about soft constraints and conditional preferences: Complexity results and approximation techniques
    • Acapulco, Mexico, August
    • Domshlak, C., F. Rossi, K.B. Venable, and T. Walsh. (2003). "Reasoning About Soft Constraints and Conditional Preferences: Complexity Results and Approximation Techniques." In Proc. of IJCAI, Acapulco, Mexico, August.
    • (2003) Proc. of IJCAI
    • Domshlak, C.1    Rossi, F.2    Venable, K.B.3    Walsh, T.4
  • 10
    • 0032641691 scopus 로고    scopus 로고
    • Background to qualitative decision theory
    • Doyle, J. and R.H. Thomason. (1999). "Background to Qualitative Decision Theory." AI Magazine 20(2), 55-68.
    • (1999) AI Magazine , vol.20 , Issue.2 , pp. 55-68
    • Doyle, J.1    Thomason, R.H.2
  • 14
  • 16
    • 84880740195 scopus 로고    scopus 로고
    • The computational complexity of dominance and consistency in CP-nets
    • Goldsmith, J., J. Lang, M. Truszczynski, and N. Wilson, (2005), "The Computational Complexity of Dominance and Consistency in CP-Nets." In Proc. of IJCAI.
    • (2005) Proc. of IJCAI
    • Goldsmith, J.1    Lang, J.2    Truszczynski, M.3    Wilson, N.4
  • 17
    • 2442676770 scopus 로고    scopus 로고
    • Preference logic
    • D.M. Gabbay and F. Guenthner, editors, volume 4. Kluwer
    • Hansson, S.O. (2001). "Preference Logic." In D.M. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 4, pp. 319-394. Kluwer.
    • (2001) Handbook of Philosophical Logic , pp. 319-394
    • Hansson, S.O.1
  • 18
    • 9444237735 scopus 로고    scopus 로고
    • From preference representation to combinatorial vote
    • Lang, J. (2002). "From Preference Representation to Combinatorial Vote." In Proc. of KR.
    • (2002) Proc. of KR
    • Lang, J.1
  • 19
    • 0036926279 scopus 로고    scopus 로고
    • Efficient utility functions for ceteris paribus preferences
    • McGeachie, M. and J. Doyle, (2002), "Efficient Utility Functions for Ceteris Paribus Preferences," In Proc. of AAAI, pp. 279-284.
    • (2002) Proc. of AAAI , pp. 279-284
    • McGeachie, M.1    Doyle, J.2
  • 21
    • 27144501015 scopus 로고    scopus 로고
    • Constraint-based preferential optimization
    • Pittsburgh. Pennsylvania, July 9-13, Morgan Kaufmann
    • Prestwich, S., F. Rossi, K.B. Venable, and T. Walsh. (2005). "Constraint-Based Preferential Optimization." In Proc. of AAAI Pittsburgh. Pennsylvania, July 9-13, Morgan Kaufmann.
    • (2005) Proc. of AAAI
    • Prestwich, S.1    Rossi, F.2    Venable, K.B.3    Walsh, T.4
  • 23
    • 0002582645 scopus 로고
    • Valued constraint satisfaction problems: Hard and easy problems
    • Schiex, T. H. Fargier, and G. Verfaule. (1995). "Valued Constraint Satisfaction Problems: Hard and Easy Problems." In Proc. of IJCAI pp. 631-637.
    • (1995) Proc. of IJCAI , pp. 631-637
    • Schiex, T.1    Fargier, H.2    Verfaule, G.3
  • 24
    • 0001553684 scopus 로고
    • "Possibilistic constraint satisfaction problems," or "How to Handle Soft Constraints?"
    • Schiex, T. (1992). "Possibilistic Constraint Satisfaction Problems," or "How to Handle Soft Constraints?." In Proc. of UAI, pp. 269-275.
    • (1992) Proc. of UAI , pp. 269-275
    • Schiex, T.1


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