演算

We design a new feature extraction method that generates rotation and translation invariant features and use the Procrustes algorithm to find the key substructures which are denoted by radicals.

我们设计了一个不受旋转及位移影响的特徵撷取方法并使用Procrustes演算法来找出蛋白质结构中可能的重要区块。

The model for deductive theory is the propositional calculus.

演绎推理理论的模型是命题演算。

By using the model of this interpretation, the reliability theorem and the uniformity theorem are proved of the propositional calculus plus syllogistic system.

本文最主要的工作是建立了三段论的一种解释，并且在这种解释模型中，证明了命题演算+三段论系统的可靠性定理，一致性定理，还从语义角度，对项的周延性等问题发表了一些意见。

So-called first-order theorem proving may be restricted to a propositional calculus with terms (constants, function names, and free variables) added, making it impossible to express mathematical induction.

所谓一阶定理证明可限于命题演算的条款（常数，函数名，并免费变量）说，无法表达数学归纳法。

The formal deductive systenm for Fuzzy propositional calculus, R0-algebras and BR0-algebras have been studied. The concepts of WBR0-algebras are proposed, the relationship between it and BR0-algebras has been investigated, the definition of basis BR0-algebras is simplified. Based on discussing the relationship between regular FI-algebras and regular residual lattice, the relationship between FI-algebras and basis R0-algebras has been investigated.

研究了王国俊教授建立的模糊命题演算的形式演绎系统L和与之在语义上相匹配的R0-代数以及吴洪博教授提出的基础R0-代数和基础L系统，提出了WBR0-代数的观点，讨论了它与BR0-代数的关系，简化了BR0-代数的定义，在讨论正则FI-代数与正则剩余格之间关系的基础上，讨论了BR0-代数与FI-代数的相互关系。

We study the properties of BR0-algebra and the total complication triple I method on complete BR0-algebra, and we apply the results to R0-Unite interval W. Not only we have simplified the proof of the results of R0-type triple I method on R0-Unite interval W, but also we make the proof to combine with the formal deductive system for fuzzy propositional calculus. This work also explains that the R0-type triple I method is a matching fuzzy inference with B?

研究了基础BR0-代数的性质和基于完备基础BR0-代数的全蕴涵三I算法，对—般蕴涵算子给出了三I算法解存在的—个充分条件，并将结果应用于R0-单位区间W，不但极大的简化了R0-单位区间W的R0-型α-三I算法结果的证明，而且使其证明过程与相应的模糊命题演算系统结合起来，说明了R0-型三I算法是与B？

This paper works on propositional logic system in Computer Logic.

本论文研究了计算机数理逻辑中的命题演算部分内容。

First order logic is a most important concept in the field of propositional logic.

而一阶谓词逻辑化为其前束范式是命题演算的重要步骤。

In the field of propositional logic in computer logic, the Logic Equivalent of propositional is fundermental.

在逻辑语言的命题演算中，命题式的等价是一个基础性的问题，在判定命题式等价问题中，真值表示比较常用的一个方式。

This paper introduced the some theories of propositional logic, and gave the Computer implementation of the propositional logic calculations based on VC++.

本文在对数理逻辑领域的命题演算课题进行理论研究的基础上，对命题式的真值计算和一阶谓词命题式的前束范式化简进行了基于 VC++平台的编程实现。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。