Some results on decision for minimal covering in partial K-valued logic
Liu Ren-ren · Computer Engineering and Applications Journal · 2007
According to the completeness theory of partial K-valued logic,it is proved that if let the basic graph of the regular separable relation G2=G2({1,2})∪2 be N-cycle under the condition of m=2 and σ=e,then T(G2) is not in the minimal covering of P.