首页 | 本学科首页   官方微博 | 高级检索  
     

一阶谓词公式关联矩阵的构造方法
引用本文:耿 霞,张继军,吴秋兰.一阶谓词公式关联矩阵的构造方法[J].计算机工程与应用,2014,50(3):36-41.
作者姓名:耿 霞  张继军  吴秋兰
作者单位:山东农业大学 信息科学与工程学院,山东 泰安 271018
基金项目:国家自然科学基金(No.61170079,No.61201252);教育部科技论文快速共享项目(No.2012107);山东省优秀中青年科学家奖励基金(No.BS2009DX012).
摘    要:一阶谓词逻辑可以借助关联矩阵进行有效推理。为了提高关联矩阵的构造效率,从而提高一阶谓词逻辑推理的效率,提出一种由一阶谓词公式构造对应关联矩阵的递归方法。该方法利用二叉树的递归性质,对任意一个一阶谓词公式,在化去量词后直接构造关联矩阵。该方法为借助关联矩阵实现一阶谓词逻辑的自动化推理提供了可能。

关 键 词:一阶谓词公式  关联矩阵  逻辑推理  二叉树  递归方法  

Construction method of incidence matrix to first-order predicate expression
GENG Xia,ZHANG Jijun,WU Qiulan.Construction method of incidence matrix to first-order predicate expression[J].Computer Engineering and Applications,2014,50(3):36-41.
Authors:GENG Xia  ZHANG Jijun  WU Qiulan
Affiliation:College of Information Science and Engineering, Shandong Agricultural University, Tai’an, Shandong 271018, China
Abstract:Incidence matrix can be applied in the process of first-order predicate logical reasoning. In order to improve the construction efficiency of incidence matrix, so as to improve the efficiency of first-order predicate logical reasoning, a recursive method by which the incidence matrix of first-order predicate expression can be constructed is proposed. For any first-order predicate expression, the incidence matrix can be generated directly using the recursive property of binary tree after logical connectives are eliminated in the method. The method provides possibility to realize automatic reasoning of first-order predicate logic by means of incidence matrix.
Keywords:first-order predicate expression  incidence matrix  logical reasoning  binary tree  recursive method
本文献已被 CNKI 维普 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号