From ordered beliefs to numbers: How to elicit numbers without asking for them (doable but computationally difficult)
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Christoph F. Eick,et al. Decision making involving imperfect knowledge , 1993, IEEE Trans. Syst. Man Cybern..
[3] Hung T. Nguyen,et al. Maximum Entropy (Maxent) Method in Expert Systems and Intelligent Control: New Possibilities and Limitations , 1996 .
[4] Hung T. Nguyen,et al. A First Course in Fuzzy Logic , 1996 .
[5] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[6] J. Kacprzyk,et al. Advances in the Dempster-Shafer theory of evidence , 1994 .
[7] Didier Dubois,et al. Possibility Theory - An Approach to Computerized Processing of Uncertainty , 1988 .
[8] Vladik Kreinovich,et al. Towards theoretical foundations of soft computing applications , 1995, Proceedings the 11th Conference on Artificial Intelligence for Applications.
[9] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[10] Judea Pearl,et al. Probabilistic reasoning in intelligent systems , 1988 .
[11] George J. Klir,et al. Fuzzy sets and fuzzy logic - theory and applications , 1995 .
[12] Glenn Shafer,et al. Readings in Uncertain Reasoning , 1990 .
[13] B. Bouchon-Meunier,et al. Competitive learning of possibility distributions , 1994, Proceedings of 1994 IEEE 3rd International Fuzzy Systems Conference.
[14] Leticia S. Chee. Computing the Value of a Boolean Expression with Interval Inputs is NP-Hard , 1997, Reliab. Comput..
[15] Craig Boutilier,et al. Conditional Logics of Normality: A Modal Approach , 1994, Artif. Intell..
[16] Vladik Kreinovich,et al. Maximum Entropy Approach to Fuzzy Control , 1994, Inf. Sci..