以可计算性逻辑的完备子集cl4为基础进行知识表示，将知识分为简单知识与一般知识。
Based on the sound and complete subset CL4 of computability logic, knowledge representation is discussed by dividing knowledge into elementary and general ones.
表示出了一类赋准范空间的随机对偶空间，并证明这类赋准范空间之间，几乎处处有界线性算子所组成空间的完备性。
The random dual Spaces of a class of quasi-normed Spaces is given. The completeness of the Spaces having bounded operators all most everywhere has also been proved.
基于这种统一的表示，本文给出了简洁的几何元素位置关系的判断方法以及获得一致性的完备推理规则。
Based on these unified representations, this paper gives a succinct method to obtain positional relations between geometric elements, and a group of complete reasoning rules to make them consistent.
基于这种统一的表示，本文给出了简洁的几何元素位置关系的判断方法以及获得一致性的完备推理规则。
Based on these unified representations, this paper gives a succinct method to obtain positional relations between geometric elements, and a group of complete reasoning rules to make them consistent.
应用推荐