resolution principle

resolution principle的基本解释

-

分解法则, 分解原理

与resolution principle相关的网络例句 [注：此内容来源于网络，仅供参考]

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、对经典逻辑中基于归结原理的自动推理方法进行了研究，给出了用符号矩阵表示子句集合的一种方法，把不同的归结过程转换成矩阵的列变换。

Part Three The study of Lattice-valued Modal First-order Logic System and Its Resolution Principle In this part, we introduced quantifiers and predicate into LMP, put up lattice-valued modal first-order logic system LMF, and gave its semantic interpretation and syntax structure, proved soundness theorem and consistence theorem. Moreover, in order to judge the satisfiability of formula, defined Skolem standard type and H-interpretation. Based on these work, made a primary discussion of a - resolution principle based on LMF.

第三部分：关于格值模态一阶逻辑系统及其归结原理的研究第n页西南交通大学博士研究生学位论文这一部分主要是在格值模态命题逻辑系统LMP队）中引进量词和谓词，建立格值模态一阶逻辑系统LMF（广并给出其语又解释和语法结构，证明了系统的可靠性和协调性；另外，为了判断公式的可满足性，定义了格值模态一阶公式的 Skolem标准型和体解释；在此基础上，对基于系统LMF的a一归结原理进行了初步探讨。

The study of lattice-valued resolution principle based on lattice-valued logic with truth-value in lattice implication algebras Because of it concise, resolution principle is an implication direction in automated theorem proving, and it will be of significance to establish resolution principle based on non-classical logics.

基于格蕴涵代数的格值逻辑中归结推理的理论与方法研究归结原理由于其简洁性一直是自动定理证明中一个受到广泛重视的研究领域，因而建立基于非经典逻辑的归结方法对于非经典自动定理证明有着重要的意义。