首页> 外文会议>Fuzzy Information Processing Society, 2002. Proceedings. NAFIPS. 2002 Annual Meeting of the North American >Algorithm of transforming any formula in LP(X) to a pure-generalized conjunction normal form
【24h】

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

机译:将LP(X)中的任何公式转换为纯广义合取范式的算法

获取原文

摘要

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)中的任何公式转换为纯广义合取范式的算法。具体来说,首先介绍了有关格蕴涵代数(LIA),格值介词逻辑LP(X)和基于LP(X)的解析原理的一些重要概念和结果。然后考虑将任何蕴涵项转换为可约形式的算法。最后,给出了将LP(X)中的任何公式F转换为纯广义联合范式的方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号