连续一阶逻辑是经典一阶逻辑的一个类比。
Continuous first-order logic is an analog of classical first-order logic.
HOL比一阶逻辑更有表现力，能给复杂逻辑更加简洁的描述。
HOL is more expressive than first-order logic and enables a concise description of complex properties.
描述逻辑是一种知识表示的形式化语言，是一阶逻辑的可判定子集。
Description logic is a formal language for representing knowledge and it is a decidable subset of first-order logic.
将带广义量词Q的一阶逻辑的二值弱模型推广到取值于完备弱可补格上。
The two value weak model for first order logic with generalized quantifier Q is generalized to be valued in complete weak complemented lattices.
熟知的一阶逻辑语义因为只论及个体对象而不涉及属性实体而被认为是外延的。
The familiar semantics for first-order logic is extensional in that it is involved in individual objects rather than in any property entities.
这一结果可以用于证明一阶逻辑形式系统和我们所提出的广义反驳方法的完备性。
This result can be used to prove the completeness theorems of first order logic system and the universal refutation method proposed by us.
借助一阶逻辑演算有条件地把超限递归原理从序数类推广到具有良基关系的类上。
Let's conditionally generalize principle of transfinite recursion from ordinal number class to class with well-founded relation.
当解释的论域是一个固定大小的有限集合时，一阶逻辑公式的可满足性问题可以等价地归约为SAT 问题。
When the domain of interpretation is finite and its size is a fixed positive integer, the satisfiability problem in the first-order logic can be reduced to SAT.
为了将密码协议的非否认性和公平性统一在一个框架之下更好地进行分析，提出了一套适用于分析非否认性和公平性的一阶逻辑语法和语义。
In order to analyze the non-repudiation and fairness properties under one frame, a set of first-order logic syntax and semantics for non-repudiation protocols was proposed, and a model was built.
为了形式化验证数字现金的安全性，本文在经典一阶逻辑的基础上，吸取了多类逻辑、动态逻辑和非单调逻辑的思想，提出了BZL逻辑模型。
In order to formalize and verify the protocol, BZL logic model is built, which based on first-order logic and introduces many-sorted, dynamic and non-monotony logic.
这是一个用于一阶和逻辑方程序的自动理论证明器，用于支持语言处理中的推理。
This is an automated theorem prover for first-order and equational logic, used to support inference in language processing.
提出了两种用于一阶谓词逻辑推理的图形方法：目标制导的图形推理法和变迁框图形推理法。
Two graphical methods used in first-order predicate logical reasoning, that is goal-guiding graphical reasoning method and transition frame graphical reasoning method, are presented.
讨论了三种时间逻辑方法：一阶谓词演算，模态逻辑及具体化逻辑。
Three temporal logics i. e. first-order predicate calculus, modal logic and reified logic are discussed.
本文的目的是：为基本的一阶时态逻辑建立一个完备性定理。
The aim of this article is to establish the completeness theorem of elementary first-order temporal logic.
一阶谓词逻辑是现代逻辑中最为经典的演算系统。
Predicate logic of first order is the most classical calculation system in modern logic.
我们也能使用一阶时态逻辑，为各种研究领域建立一些特定的形式系统。
We may also use the first-order temporal logic to set some specific formal systems for various fields of studies.
之后，美籍逻辑学家歌德尔一阶谓词演算的完备性定理，这标志着现代逻辑基础部分的完成。
After this, American Logician Kurt Godel proved the completeness theory of predicate calculus. This means the completion of the base of Modern Logic.
对一阶拟线性偏微分方程与其特征方程组的关系，文中给出了简洁的逻辑分析和推导方法。
The paper has used concise methods of logical analysis and reasoning to describe the relation between the first-order quasilinear partial differential equation and its system of characteristic...
描述逻辑是一阶谓词逻辑的可判定子集，具备强大的知识表示和推理功能。
Description Logics (DLs) is a decidable subset of first-order predication logic which possesses powerful function of knowledge expressing and reasoning.
在本知识库系统模型中，知识表示采用一阶谓词(SDSS)逻辑和案例两者相结合的方式。
In this knowledge base system model, we adopt both first order predicate logic (FOPL) and case knowledge representation modes to represent the knowledge.
本文提出了一种从正负例和背景知识学习含有约束原子的一阶谓词公式的归纳逻辑程序设计方法。
In the field of Machine Learning, this thesis is presents new method to learn constraint atoms from positive and negative examples in first-order predicate, based on developed ILP system.
本文提出了一种从正负例和背景知识学习含有约束原子的一阶谓词公式的归纳逻辑程序设计方法。
In the field of Machine Learning, this thesis is presents new method to learn constraint atoms from positive and negative examples in first-order predicate, based on developed ILP system.
应用推荐