作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2006, Vol. 32 ›› Issue (23): 191-192,. doi: 10.3969/j.issn.1000-3428.2006.23.068

• 人工智能及识别技术 • 上一篇    下一篇

利用谓词/变迁网证明的一阶谓词逻辑命题

方 欢1,2,印玉兰1,2,徐誉尹2   

  1. (1. 安徽理工大学数理系,淮南 232001;2. 山东科技大学信息与工程学院,青岛 266510)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2006-12-05 发布日期:2006-12-05

First-order Predicate Logic Proposition Proved by Using Predicate/ Transition Net

FANG Huan1,2, YIN Yulan1,2, XU Yuyin2   

  1. (1. Department of Mathematics and Physics, Anhui University of Science and Technology, Huainan 232001; 2. College of Information Science and Technology, Shandong University of Science and Technology, Qingdao 266510)
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-12-05 Published:2006-12-05

摘要: 研究了证明一般的一阶谓词逻辑命题的方法,根据网逻辑的思想,利用谓词/变迁网对一般形式的一阶谓词逻辑命题进行了图形表示,提出了2种一阶谓词逻辑命题的证明方法:图形证明法和矩阵证明法。举出一个实际的例子来说明证明思路。

关键词: 网逻辑, 谓词/变迁网, 一阶谓词逻辑, 命题证明

Abstract: This paper studies the proof of first-order predicate propositions. By using predicate/transition net, first-order predicate propositions of general form can be expressed. Furthermore, two proving methods, which are proved by graphics and matrix are proposed. In the end, an example is given to illustrate the main idea of the proving procedure.

Key words: Enlogy, Predicate/Transition net, First-order predicate logic, Proposition proving