Uncertainty.Toolbox_不确定理论工具箱_uncertainty_

% truth value of uncertain proposition (Q,P,A) or (Q,S,P,A) % Q: uncertain quantifier % S: uncertain subject % P: uncertain predicate % A: individual feature date, n-vector for (Q,P,A), n*2-matrix for (Q,S,P,A) function f = ulogic(logicinput_1,logicinput_2,logicinput_3,logicinput_4) if nargin == 3 Q = logicinput_1; P = logicinput_2; A = logicinput_3; n = length(A); for i=1:1:n quantifier(i)=Q(i); end for i=1:1:n predicate(i)=P(A(i)); end predicate=sort(predicate,'descend'); for i=1:1:n neg_predicate(i)=1-predicate(n-i+1); end predicate(n+1)=1; neg_predicate(n+1)=1; for i=0:1:n if Q(i)==1 k1=i; break; end end if k1==0 k1=n+1; end for i=n:(-1):0 if Q(i)==1 k1star=i; break; end end k1star=n-k1star; if k1star==0 k1star=n+1; end for i=0:1:n if Q(i)==0 k0=i; break; end end if k0==0 k0=n+1; end for i=n:(-1):0 if Q(i)==0 k0star=i; break; end end k0star=n-k0star; if k0star==0 k0star=n+1; end if min(predicate(k1),neg_predicate(k1star))==1 T=1; elseif min(predicate(k0),neg_predicate(k0star))==0 T=0; else b=0; t=1; while(t-b>0.0001) c=(b+t)./2; for i=0:1:n if Q(i)>c k=i; break; end end if k==0 k=n+1; end for i=n:(-1):0 if Q(i)>c kstar=i; break; end end kstar=n-kstar; if kstar==0 kstar=n+1; end T=min(predicate(k),neg_predicate(kstar)); if T>c b=c; else t=c; end end end if nargin == 4 Q = logicinput_1; S = logicinput_2; P = logicinput_3; A = logicinput_4; n = length(A(:,1)); end f = T; end