Symbolic logic is often divided into two branches, propositional logic and predicate logic.
符号逻辑往往分为两个分支,命题逻辑和谓词逻辑。
Knowledge Compilation emerged in recent years as a new research direction; it is used to deal with the computational complexity of propositional logic.
知识编译是近年来出现的一个新的研究方向,它用于处理一般命题逻辑推理的计算复杂性。
This paper introduces a method for propositional logic calculation.
介绍了命题逻辑演算方法。
Stoicism denies anything immaterial and tries to explain the world through propositional logic.
斯多噶学派否认任何非物质的,并试图通过命题逻辑来解释世界。
An important way for solving intelligent planning problem is translating it into propositional logic to solve.
求解智能规划问题的一个重要方法即把智能规划问题转化为命题逻辑公式求解。
This paper presented an automated reasoning algorithm for natural deduction system (NR) of relevance propositional logic.
给出了相干命题逻辑自然推理系统NR的自动证明算法。
Because perfect IF inferences donot involve modal concepts, idealized IF logic is analogous to classical propositional logic.
完美信息流推理不涉及模态概念,理想信息逻辑类似经典命题逻辑。
From the syntactical point of view, the concept of the syntactic truth degree of formulas is proposed in two-valued propositional logic system.
本文从语构理论入手,在经典二值命题逻辑系统中给出公式的语构真度的概念,从两个不同的角度给出语构真度的等价刻画。
This dissertation begins with the research of similarity degree, then pseudo-metric and approximate reasoning in propositional logic system are studied.
本文从命题逻辑公式的相似度入手,研究命题逻辑公式集上的伪距离和近似推理。
This paper explains the proposition and propositional logic, giving the definitions, forms and usages of negation, conjunction, disjunction, implication and equivalence.
解释命题、命题逻辑和其涉及的否定、合取、析取、蕴涵和等价等定义,同时分析它们的形式和用法。
Propositional logic in the inference rule can be used to prove that a propositional formula has been expressed as the theorem, but it is not easy to implement mechanization.
命题逻辑中的推理规则可以用来证明一个已经表示成命题公式的定理,但它还不便于机械化实施。
Propositional logic in the inference rule can be used to prove that a propositional formula has been expressed as the theorem, but it is not easy to implement mechanization.
详细说明:命题逻辑中的推理规则可以用来证明一个已经表示成命题公式的定理,但它还不便于机械化实施。
Firstly, on the basis of implication, originating from the limited Disturbing Fuzzy Propositional logic, discusses its logic algebra and the properties of its generalized tautology.
首先以蕴涵算子为基础从有限扰动模糊命题逻辑出发,讨论其逻辑代数及广义重言式的性质。
Firstly, on the basis of implication, originating from the limited Disturbing Fuzzy Propositional logic, discusses its logic algebra and the properties of its generalized tautology.
首先以蕴涵算子为基础从有限扰动模糊命题逻辑出发,讨论其逻辑代数及广义重言式的性质。
应用推荐