谓词逻辑

This paper deals with the background of the celebrated Goodman s new riddle of induction and the logic and semantics of predicate grue .

本文回顾了古德曼的新归纳之谜的背景，分析了格路谓词的逻辑与语义特征。

Predicate Calculus language of the traditional semantic component of the mathematical logic of a very rich branch.

谓词演算语言的传统的语义组成了数理逻辑的一个很丰富的分支。

Resolution-based many-sorted predicate calculus has been applied to many fields of computer science, such as knowledge representation, artificial intelligence and automatic theorem proving, software specification and verification, etc.

在前人工作的基础上，对自动推理领域的如下问题进行了研究与探索：基于归结原理的多种类谓词演算、模糊逻辑与近似推理、Web环境下的知识表示与自动推理等。

The problem solving and inference functions will be provided by the hardware inference mechanism,the control mechanism,parallel processing,the logic programs developed on these machines and the software system for high-order predicate calculus.

FGCS的功能可分成3类：问题的求解和推理功能、基于知识的管理功能和智能接口功能问题的求解和推理功能将由硬件推理机制、控制机制、并行处理，以及在这些机制上开发的逻辑编程及高阶谓词演算软件系统提供。

Prenex normal form of the first order logic propositional is the key to propositional logic. Generally, there are three steps to change get a prenex normal form: first of all get rid of the connection word; Secondly, make the negative word to the front of every atomic.

对于一阶谓词化为其前束范式问题，一般可以通过三个步骤完成，首先去掉逻辑式中的连接词；其次将否定词深入到各原子公式中；最后利用永真等价式将量词逐个移到式子的前部。

In 1879, the publication of ""Concept Writing"" marks the foundation of propositional calculus and the predicate calculus —— the basic part of mathematical logic.

1879年《概念文字》的出版，标志着数理逻辑的基础部分——命题演算和谓词演算正式建立。

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

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

Of course God's omniscience is not limited to the distinctions between subjects and predicates, logical sequence, exegetical research, or discursive reasoning.

当然，上帝的无所不知，是不是仅限于区分科目和谓词，逻辑顺序，训诂学研究，或散漫的推理。

The paper detailedly introduces two methods of the regiseter renaming in X high-performance microprocessor, respectively implemented through register rotation and register stack, give an example to show how software pipelining supported by register rotation overcomes the disadvantage to code optimization induced by traditional unloop method, and furthermore implements the renaming design of general register, floating point register and predication register.

本文详细介绍X高性能微处理器中寄存器旋转和寄存器堆栈方式实现的寄存器重命名，举例说明寄存器旋转支持的软件流水技术如何克服传统循环展开方法给代码优化带来的弊端，并进一步给出通用、浮点和谓词寄存器重命名逻辑的具体实现。

A framework of temporal topological relationship representation based on point-set topology, which can be used to describe temporal topological relationships completely and uniquely, is presented.

同时，给出了时态拓扑关系完备且唯一的点集拓扑理论描述及其等价的逻辑谓词描述。

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.

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