PROBABILITIES, POSSIBILITIES, AND FUZZY-SETS

被引:22
作者
DRAKOPOULOS, JA
机构
[1] Department of Computer Science, Knowledge Systems Laboratory, Stanford University, Palo Alto, CA 94304-0106
基金
美国国家航空航天局;
关键词
PROBABILITY; POSSIBILITY; FUZZY SETS; ARTIFICIAL INTELLIGENCE; UNCERTAINTY; MEASURE AND SET THEORY; RELATIONS;
D O I
10.1016/0165-0114(94)00341-4
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A formal analysis of probabilities, possibilities, and fuzzy sets is presented in this paper. A number of theorems proved show the above measures have equal representational power when their domains are infinite. However, for finite domains, it is proved that probabilities have a higher representational power than both possibilities and fuzzy sets. The cost of this increased power is high computational complexity and reduced computational efficiency. The resulting trade-off of high complexity and representational power versus computational efficiency is discussed under the spectrum of experimental systems and applications.
引用
收藏
页码:1 / 15
页数:15
相关论文
共 36 条
[21]   FUZZINESS VS PROBABILITY [J].
KOSKO, B .
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS, 1990, 17 (2-3) :211-240
[22]  
LINDLEY DV, 1987, STAT SCI, V2, P17, DOI DOI 10.1214/SS/1177013427
[23]  
LUKASIEWICZ J, 1970, J LUKASIEWICZ SELECT, P16
[24]  
NEAPOLITAN E, 1990, PROBABILISTIC REASON
[25]   PROBABILISTIC LOGIC [J].
NILSSON, NJ .
ARTIFICIAL INTELLIGENCE, 1986, 28 (01) :71-87
[26]  
Pal S.K., 1986, FUZZY MATH APPROACH
[27]  
Papoulis A., 1991, COMMUNICATIONS SIGNA, V3rd
[28]  
PEARL J, 1990, ANN REV COMPUTER SCI, V4, P37
[29]  
Shafer G., 1976, MATH THEORY EVIDENCE, DOI DOI 10.1515/9780691214696
[30]  
Shortliffe E. H., 1976, COMPUTER BASED MED C