首页> 外文会议>Annual Meeting of the North American Fuzzy Information Processing Society >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) is 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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号