Algorithm of transforming any formula in LP(X) to a pure-generalized conjunction normal form

2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622) Pub Date : 2002-08-07 DOI:10.1109/NAFIPS.2002.1018027

D. Meng, Yang Xu, K. Qin

引用次数: 3

Abstract

In the present paper the algorithm of transforming any formula in LP(X) to a pure-generalized conjunction normal form is focused. Concretely, some important concepts and results about lattice implication algebra (LIA), lattice-valued prepositional logic LP(X) and resolution principle based on LP(X) are introduced firstly. Then algorithm of transforming any implication term to a reducible form is considered. Finally, the method of transforming any formula F in LP(X) to a pure-generalized conjunction normal form is given.

查看原文本刊更多论文

将LP(X)中任意公式转化为纯广义合取范式的算法

本文研究了将LP(X)中的任意公式转化为纯广义合取范式的算法。具体地说，首先介绍了格蕴涵代数、格值介词逻辑LP(X)和基于LP(X)的解析原理的一些重要概念和结果。然后研究了任意隐含项转化为可约形式的算法。最后，给出了将LP(X)中的任意公式F转化为纯广义合取范式的方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2002 Annual Meeting of the North American Fuzzy Information Processing Society Proceedings. NAFIPS-FLINT 2002 (Cat. No. 02TH8622)

自引率

0.00%

发文量