메뉴 건너뛰기




Volumn 13, Issue 9, 1998, Pages 801-820

From ordered beliefs to numbers: How to elicit numbers without asking for them (Doable but computationally difficult)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; KNOWLEDGE ACQUISITION; KNOWLEDGE REPRESENTATION; NUMBER THEORY; PROBLEM SOLVING;

EID: 0032165949     PISSN: 08848173     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-111X(199809)13:9<801::AID-INT2>3.0.CO;2-M     Document Type: Article
Times cited : (2)

References (17)
  • 2
    • 0028465523 scopus 로고
    • Conditional logics of normality: A modal approach
    • C. Boutilier, "Conditional logics of normality: a modal approach," Artificial Intell., 68, 87-154 (1994).
    • (1994) Artificial Intell. , vol.68 , pp. 87-154
    • Boutilier, C.1
  • 3
    • 2342468773 scopus 로고    scopus 로고
    • Computing the value of a Boolean expression with interval inputs is NP-hard
    • L.S. Chee, "Computing the value of a Boolean expression with interval inputs is NP-hard," Reliable Comput., 3, 155-172 (1997).
    • (1997) Reliable Comput. , vol.3 , pp. 155-172
    • Chee, L.S.1
  • 5
    • 0027601798 scopus 로고
    • Decision blocks - A tool for rule-based decision making involving imperfect knowledge
    • C.F. Eick and N.M. Mehta, "Decision blocks - a tool for rule-based decision making involving imperfect knowledge," IEEE Trans. Syst. Man, Cybernetics, 23, 840-850 (1993).
    • (1993) IEEE Trans. Syst. Man, Cybernetics , vol.23 , pp. 840-850
    • Eick, C.F.1    Mehta, N.M.2
  • 7
    • 51249181779 scopus 로고
    • A new polynomial-time algorithm for linear programming
    • N. Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica, 4, 373-396 (1984).
    • (1984) Combinatorica , vol.4 , pp. 373-396
    • Karmarkar, N.1
  • 8
    • 0000564361 scopus 로고
    • A polynomial-time algorithm for linear programming
    • L.G. Khachiyan, "A polynomial-time algorithm for linear programming," Sov. Math. Dokl., 20, 191-194 (1979).
    • (1979) Sov. Math. Dokl. , vol.20 , pp. 191-194
    • Khachiyan, L.G.1
  • 10
    • 0002049410 scopus 로고    scopus 로고
    • Maximum entropy (Max-Ent) method in expert systems and intelligent control: New possibilities and limitations
    • K.M. Hanson and R.N. Silver, Eds., Kluwer, Dordrecht
    • V. Kreinovich, H.T. Nguyen, and E.A. Walker, "Maximum entropy (Max-Ent) method in expert systems and intelligent control: New possibilities and limitations," in Maximum Entropy and Bayesian Methods, K.M. Hanson and R.N. Silver, Eds., Kluwer, Dordrecht, 1996, pp. 93-100.
    • (1996) Maximum Entropy and Bayesian Methods , pp. 93-100
    • Kreinovich, V.1    Nguyen, H.T.2    Walker, E.A.3
  • 11
    • 0028752180 scopus 로고
    • Competitive learning of possibility distributions
    • IEEE Press, New York
    • X. Ménage and B. Bouchon-Meunier, "Competitive learning of possibility distributions," Proc. Third IEEE Conf. on Fuzzy Systems, IEEE Press, New York, 1994 Vol. I, pp. 442-445.
    • (1994) Proc. Third IEEE Conf. on Fuzzy Systems , vol.1 , pp. 442-445
    • Ménage, X.1    Bouchon-Meunier, B.2
  • 15
    • 0028543383 scopus 로고
    • Maximum entropy approach to fuzzy control
    • A. Ramer and V. Kreinovich, "Maximum entropy approach to fuzzy control," Inform. Sci., 81, 235-260 (1994).
    • (1994) Inform. Sci. , vol.81 , pp. 235-260
    • Ramer, A.1    Kreinovich, V.2


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