Continuous first-order logic is an analog of classical first-order logic.
连续一阶逻辑是经典一阶逻辑的一个类比。
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.
为了将密码协议的非否认性和公平性统一在一个框架之下更好地进行分析，提出了一套适用于分析非否认性和公平性的一阶逻辑语法和语义。
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的一阶逻辑的二值弱模型推广到取值于完备弱可补格上。
The two value weak model for first order logic with generalized quantifier Q is generalized to be valued in complete weak complemented lattices.
将带广义量词Q的一阶逻辑的二值弱模型推广到取值于完备弱可补格上。
应用推荐