- 更多网络例句与归结子句相关的网络例句 [注：此内容来源于网络，仅供参考]
-
The soundness and completeness theorem of this method were proved at last. 5. The a-automated reasoning method based on the a-resolution principle of LP was discussed, the author given a method to describe the set of simple generalized clauses (veriables and non-subregular 1 - IBSFs are only contained) by using a matrix, and translated the a-resolution of two clauses to column operations of this matrix.
最后，证明了该方法的可靠性和完备性； 5、对格值命题逻辑系统LP中基于α-归结原理的α-自动推理方法进行了研究，给出了用符号矩阵表示一类简单的广义子句集合(只含命题变元和非正则1-IESF广义文字)的方法，把α-归结原理转换成矩阵的列变换。
-
The soundness and completeness theorem of this method were proved at last. This part consists of the following points: 1. The properties of the indecomposable extremely simple form of LP were discussed, the theorem shown that every logical formula of LP was equals of a generalized conjunction normal form. 2. The method for judging a logical formula is a indecomposable extremely simple form or not was discussed, the necessary and sufficient conditions of a logical formula with not more than three implicative connective being a indecomposable extremely simple form was given. 3. The α-resolution fields of the indecomposable extremely simple form of LP were discussed, some elementary results were obtained. 4. The automated reasoning method based on the resolution principle of classical logic was discussed, the author given a method to describe the set of clauses by using a matrix, and translated the resolution of two clauses to column operations of this matrix.
二、关于格值命题逻辑系统LP中α-自动推理方法的研究 1、对LP中不可分极简式的性质进行了研究，证明了LP中任何一个格值逻辑公式等值于一个广义合取范式； 2、对LP中不可分极简式的判定方法进行了研究，讨论了含有不超过3个蕴涵运算的格值逻辑式为不可分极简式的充分必要条件； 3、对LP中不可分极简式的α-归结域进行了研究，得到了一些基本结果； 4、对经典逻辑中基于归结原理的自动推理方法进行了研究，给出了用符号矩阵表示子句集合的一种方法，把不同的归结过程转换成矩阵的列变换。
-
As a special case, we studied the resolution-like procedures of lattice-valued Horn-clause with truth-value in lattice implication algebra, and discussed the lattice-valued Prolog language based on that kind of lattice-valued Horn-clause.
作为特殊情形，特别研究了基于格蕴涵代数的格值Horn子句的类归结方法，并对建立其上的格值Prolog语言作了一定的探讨。
- 更多网络解释与归结子句相关的网络解释 [注：此内容来源于网络，仅供参考]
-
apodosis：归结子句
apodictic 绝然的 | apodosis 归结子句 | apoferritin 去铁铁朊
-
apodictic：绝然的
apodia 无足 | apodictic 绝然的 | apodosis 归结子句
-
apodous：无足动物的, 无腹鳍的
apodosis | 归结子句 | apodous | 无足动物的, 无腹鳍的 | apoenzyme | 脱辅基酶蛋白