谓词演算

wèi cí yǎn suàn
  • predicate calculus
谓词演算谓词演算
  1. 随着本体在各个领域的广泛应用,本体的表示方法也成为近年来研究热点之一,目前存在多种本体表示语言,主要分为基于谓词演算、基于图和面向Web三类。

    With the widely application of Ontology in various fields , ontology representation has become one of hot spots in recent years , Nowadays there are many kinds of ontology language which are mainly based on predicate calculus , chart and web-oriented .

  2. 狭义的中介系统仅指中介逻辑ML,它由中介命题系统MP及其扩张系统MP、中介谓词演算系统MF及其扩张系统MF,以及带等词的中介谓词演算系统ME组成。

    The narrow medium system only consists of the medium propositional system MP and its expansion MP , the medium predicate calculus system MF and its expansion MF and the system ME .

  3. 本文为参考文献[7]的续篇,在此继续生成中介逻辑的谓词演算系统MF的形式定理。

    This paper is the continuation of Reference [ 7 ] .

  4. 本文将说明建基于二级谓词演算的ZF系统,无论从概念(意义)上或形式推导上都优于BG系统。

    It has been proved that the ZF system based on second order predicate calculus is superior to BG system both in conception and in formulation .

  5. 文中为多理论系统建立了一个层次的理论框架&MT.MT在几个方面推广了传统的二型一阶谓词演算:允许表示多个理论,每个理论都在一个context内声明;

    A hierarchical logical framework , MT , is defined , which is suited for representing and reasoning with multiple theories . MT extends classical two sort predicate calculus in several ways : Allowing to represent multiple theories , each theory is stated in a context ;

  6. 本文借助中介逻辑谓词演算系统MFM,对不完全信息系统的理论和应用进行了研究。

    This paper investigates the theory and application of incomplete information system by using the medium logic predicate calculus system MFM .

  7. 最后,建立了中介逻辑谓词演算系统MFM的表推演系统,并证明了该系统的可靠性和完备性,该系统可作为不完全信息的自动推演系统。

    At last , the tableau system of medium logic predicate calculus system MFM is constructed , and the soundness and completeness of the system is proved . This system can act as the automated reasoning system in incomplete information environments .

  8. 一阶谓词演算定理机器证明的余式方法

    Remainder method for the mechanical theorem proving in first-order predicate calculus

  9. 复合对象选择条件中的量词约束及谓词演算

    Quantity Limitation and Predicate Calculus in Selection Condition of Composite Objects

  10. 这就是一个一阶谓词演算不可表述的属性。

    This is not expressible as a first-order predicate calculus property .

  11. 同时,从各方面来说,一阶谓词演算都不是足够好。

    Also , first-order predicate calculus isn 't good enough anyway .

  12. γω演算与谓词演算融合于一阶数学理论中

    Merging γω - calculus and predicate calculus in a first-order mathematical theory

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

    The atomic formula is called atom for short in predicate calculus .

  14. 一个新的模糊谓词演算形式系统

    A new formal deductive system for fuzzy predicate calculus

  15. 试论谓词演算的几何化问题

    An attempt at discussing geometrization problem of predicate calculus

  16. 管理信息本体需求的谓词演算有限集构造

    Construction of predicate calculus finite set based on the requirement of management information ontology

  17. 本文扩充了[1]的谓词演算系统。

    This paper extends the predicate deduction system in the reference [ 1 ] .

  18. 中介谓词演算系统ME与ME之间的化归算法及其应用

    Algorithm and Its Applications of Transformation between Medium Predicate Calculus Systems ME and ME

  19. 中介逻辑的谓词演算系统(Ⅰ)

    Predicate calculus system of medium logic (ⅰ)

  20. 讨论了三种时间逻辑方法:一阶谓词演算,模态逻辑及具体化逻辑。

    Three temporal logics i.e. first-order predicate calculus , modal logic and reified logic are discussed .

  21. 程序模式和谓词演算

    Program schemas and predicate calculus

  22. 谓词演算中的原子公式

    Atomic formula in predicate calculus

  23. 谓词演算中的连接词

    Connective in predicate calculus

  24. 引入了一阶谓词演算和前后断言方法,并且自定义了一个重构可靠性证明的逻辑推理系统:重构可靠性推演系统。

    This paper introduces first-order predicate calculus and assertion method from precondition to postcondition into the research of refactoring .

  25. 一个合法的谓词演算表达式,即谓词演算语法所允许的公式。

    A legitimate expression of the predicate calculus . That is , it is acceptable under the predicate calculus ' syntax .

  26. 使用谓词演算来进行知识的表示和推理,能代表实际应用中的许多问题。

    Using predicate calculation to carry on knowledge 's mean and reason logically , can represent many problem within actual application .

  27. 本文将三值逻辑谓词演算系统MF~M应用在不完全信息数据库的研究中,对原有的扩充关系模型做了改进。

    In this paper , the original extended relational model has been improved by adopting MFM in the research of incomplete information database .

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

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

  29. 1879年《概念文字》的出版,标志着数理逻辑的基础部分&命题演算和谓词演算正式建立。

    In 1879 , the publication of " Concept Writing " marks the foundation of propositional calculus and the predicate calculus & the basic part of mathematical logic .

  30. 中介逻辑命题演算系统MP~M和中介逻辑谓词演算系统MF~M是一种适用于处理不完全信息的新的逻辑系统。

    The Medium Logic Propositional Calculus System MPM and the Medium Logic Predicate Calculus System MFM are new logic systems . They are fit for dealing with incomplete information .