Continuous first-order logic is an analog of classical first-order logic.
连续一阶逻辑是经典一阶逻辑的一个类比。
HOL is more expressive than first-order logic and enables a concise description of complex properties.
HOL比一阶逻辑更有表现力，能给复杂逻辑更加简洁的描述。
Description logic is a formal language for representing knowledge and it is a decidable subset of first-order logic.
描述逻辑是一种知识表示的形式化语言，是一阶逻辑的可判定子集。
The familiar semantics for first-order logic is extensional in that it is involved in individual objects rather than in any property entities.
熟知的一阶逻辑语义因为只论及个体对象而不涉及属性实体而被认为是外延的。
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.
当解释的论域是一个固定大小的有限集合时，一阶逻辑公式的可满足性问题可以等价地归约为SAT 问题。
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.
为了形式化验证数字现金的安全性，本文在经典一阶逻辑的基础上，吸取了多类逻辑、动态逻辑和非单调逻辑的思想，提出了BZL逻辑模型。
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.
为了将密码协议的非否认性和公平性统一在一个框架之下更好地进行分析，提出了一套适用于分析非否认性和公平性的一阶逻辑语法和语义。
The logic is that parse will look first for a string, then for an integer, and finally for a real, in that order, in the input stream.
这里的逻辑是parse将在输入流中首先查找一个字符串，然后查找整数，最后查找一个实数。
This is an automated theorem prover for first-order and equational logic, used to support inference in language processing.
这是一个用于一阶和逻辑方程序的自动理论证明器，用于支持语言处理中的推理。
This result can be used to prove the completeness theorems of first order logic system and the universal refutation method proposed by us.
这一结果可以用于证明一阶逻辑形式系统和我们所提出的广义反驳方法的完备性。
The two value weak model for first order logic with generalized quantifier Q is generalized to be valued in complete weak complemented lattices.
将带广义量词Q的一阶逻辑的二值弱模型推广到取值于完备弱可补格上。
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.
本文的目的是：为基本的一阶时态逻辑建立一个完备性定理。
We may also use the first-order temporal logic to set some specific formal systems for various fields of studies.
我们也能使用一阶时态逻辑，为各种研究领域建立一些特定的形式系统。
In an interesting twist of logic, the teachings tell us that in order to always be journeying forward, we must first turn back to our origin: the primeval ground of basic goodness.
这是一个有趣的逻辑悖论：香巴拉教法告诉我们为了不断前行，我们首先要回到我们的本源：我们美德的原始基础。
Predicate logic of first order is the most classical calculation system in modern logic.
一阶谓词逻辑是现代逻辑中最为经典的演算系统。
Description Logics (DLs) is a decidable subset of first-order predication logic which possesses powerful function of knowledge expressing and reasoning.
描述逻辑是一阶谓词逻辑的可判定子集，具备强大的知识表示和推理功能。
The access control rule of the ACBAC model is formalized by the first order predicate logic. The realization method of the model in business process management systems is also discussed.
文章用一阶谓词对该模型的访问控制约束规则进行了形式化描述，并讨论了该模型在业务流程管理系统中的实现方法。
In this knowledge base system model, we adopt both first order predicate logic (FOPL) and case knowledge representation modes to represent the knowledge.
在本知识库系统模型中，知识表示采用一阶谓词(SDSS)逻辑和案例两者相结合的方式。
In this knowledge base system model, we adopt both first order predicate logic (FOPL) and case knowledge representation modes to represent the knowledge.
在本知识库系统模型中，知识表示采用一阶谓词(SDSS)逻辑和案例两者相结合的方式。
应用推荐