一阶谓词公式关联矩阵的构造方法-计算机工程与应用.PDF
36 2014 ,50(3 ) Computer Engineering and Applications 计算机工程与应用
一阶谓词公式关联矩阵的构造方法
耿 霞,张继军,吴秋兰
GENG Xia, ZHANG Jijun, WU Qiulan
山东农业大学 信息科学与工程学院,山东 泰安 271018
College of Information Science and Engineering, Shandong Agricultural University, Tai ’an, Shandong 271018, China
GENG Xia, ZHANG Jijun, WU Qiulan. Construction method of incidence matrix to first-order predicate expression.
Computer Engineering and Applications, 2014, 50 (3 ):36-41.
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.
Key words :first-order predicate expression; incidence matrix; logical reasoning; binary tree; recursive method
摘 要:一阶谓词逻辑可以借助关联矩阵进行有效推理。为了提高关联矩阵的构造效率,从而提高一阶谓词逻辑推理
的效率,提出一种由一阶谓词公式构造对应关联矩阵的递归方法。该方法利用二叉树的递归性质,对任意一个一阶谓
词公式,在化去量词后直接构造关联矩阵。该方法为借助关联矩阵实现一阶谓词逻辑的自动化推理提供了可能。
关键词:一阶谓词公式;关联矩阵;逻辑推理;二叉树;递归方法
文献标志码:A 中图分类号:TP301 doi :10.3778/j.issn. 1002-8331.1303-0430
[2]
1 引言 应关联矩阵 ,但对非Horn 子句的谓词逻辑不适用。
一阶谓词逻辑可以利用高级Petri 网系统中的谓词/ 本文提出一种由一阶谓词公式直接构造其关联矩
[1-7] 阵的方法,即在化去谓词公式的量词后直接构造关联矩
变迁系统(简称为Pr/T 系统)进行建模 ,同时,基于Pr/T
系统的关联矩阵,采用线性代数中关于矩阵变换的处理, 阵。此方法适用于所有的一阶谓词公式。
实现了一阶谓词逻辑的推理,文献[1-2 ,7- 11]对关联矩
阵在逻辑推理中的应用进行了研究。