Equivalence Knowledge Mass and Approximate Reasoning in -Logic (I)

By casting off the direct restriction of topological structure, this paper presents another matching scheme between the input A ∗ and the knowledge A → B based on the equivalence relation R on formulae set F(S) and the corresponding equivalence classification F(S)/R = {(A)R |A ∈F (S)}