查询词典 statement calculus

This paper proposes a formal framework based on predicate calculus that maps object models into relational ones to construct persistent object layer.

通过使用一种基于谓词逻辑的形式化框架来匹配对象模型到关系模型以构建持久对象层。

The structure and process in PI is similarly to deduction in logic. But PI has much richer structures than predicate calculus. It is a complex of logic and psychology.

PI的结构与过程类似于逻辑中的演绎推理，但它的可取之处在于它可以提供比谓词逻辑更加丰富的结构形式，它是心理学与逻辑的综合。

In particular, the authors' original formulation of Gdel's completeness proof for the predicate calculus has been updated.

尤其是，作者们哥德尔完备性证明原制定的谓词演算已被更新。

In the predicate calculus, a connector connecting two conjunctive formulas denoted by sign ∧or∩.

在谓词演算中，一种连接二个合式公式的连接符，用符号∧或∩表示。

This has led some people who design the specification mechanisms for programming languages, or in the case of UML, for modeling languages, to include facilities from first-order predicate calculus as a language extension.

这就促使一些人在编程语言的描述机制和建模语言处理机制中加进了部分一阶谓词演算的东西，作为一种功能扩展。

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 atom ic formula is called atom for short in predicate calculus.

在谓词演算中，有时将原子公式简称为原子。

After this, American Logician Kurt Godel proved the completeness theory of predicate calculus. This means the completion of the base of Modern Logic.

之后，美籍逻辑学家歌德尔一阶谓词演算的完备性定理，这标志着现代逻辑基础部分的完成。

So we present an algorithm based on reachability analysis, and a more complex one which uses a stronger temporal logic (timed predicate μ, calculus) and can verify more properties.

在模型检测的算法方面，本文首先给出了时间符号迁移图上的一个可达性分析算法，随后还定义了能刻划更复杂性质的实时谓词μ演算并给出了检测这些性质的相应模型检测算法。

So anything that you may want to express on a complex object that would seem to require first-order predicate calculus can be expressed actually quite nicely within the confines of the programming language.

所以对于一个复杂对象，任何看起来需要一阶谓词演算才能描述的东西，实际都可以在编程语言范畴内实现十分精细地表述。

"Second Life is remarkably easy to work with, and is very popular,"

"第二次生命是显着容易的工作，并且很受欢迎，"

For example, we usually assume that materials are homogeneous and isotropic and free of internal defects or flaws.

为了得到适合有限元分析的模型，我们必须经过如图2所示的简化步骤。