Equivalence Knowledge Cumularspharolith and IV-type Completeness of the Knowledge Base K in R-logic CR

By casting off the direct restriction of topological structure, this paper presents another matching scheme between the input A* and the knowledge A rarr B based on the equivalence relation R on formulae set F(S) and the corresponding equivalence classification F(S)/R = {[A]_R A isin F(S)} therefore, obtains another algorithm of approximate reasoning - the IV-type R-algorithm. The paper presents the IV-type completeness and the IV- type perfection of the knowledge base K, in R-logic Copf_R and regular R-logic Copf_R.