基本合取式

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

Disjunction normal form theorem in the modal logic system S5 is inductively proved, which can be used for representing complex modal formulas by means of conjunction and disjunction of simplest modal formulas with depth at most 1 in the system S5. As application, it is proved that a knowledge base could answer KB-queries if and only if it could answer queries of non-modal propositions and their negations, which is a basic problem on knowledge base.

研究了模态逻辑系统S5中的析取范式定理的归纳证明，给出了在S5中用深度至多等于1的最简模态公式通过析取与合取运算表示含有多重模态词的公式的方法，作为范式定理的应用，讨论了知识库中的一个基本问题，证明了知识库能够回答KB命题式问题的充要条件是该知识库能够回答相关的非模态命题及其否定命题的问题。

Do you know, i need you to come back

你知道吗，我需要你回来

Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.

1〕 杨银书，王祥生，李德昌。安徽省首次发现嗜群血蜱。