含有否定命题逻辑推理的一致性模糊Petri网模型  

Consistent Fuzzy Petri Nets Model for Logic Programs with Negation

作　　者：汪洋[1] 林闯[1] 曲扬[1] 李雅娟[1] 

机构地区：[1]清华大学计算机系,北京100084

出　　处：《电子学报》2006年第11期1955-1960,共6页Acta Electronica Sinica

基　　金：国家自然科学基金重大研究计划重点项目(No.90412012);国家自然科学基金(No.60573144;No.60503052);国家973重点基础研究发展规划(No.2003CB314804)

摘　　要：模糊Petri网(Fuzzy Petri Net,FPN)是Petri网(Petri Net,PN)的模糊化描述的一种扩充.基于FPN模型的模糊推理规则表示和模糊推理已经得到了广泛的研究.传统的方法不能准确表示含有否定命题的产生式规则,并解决正确推理问题.本文讨论了模糊逻辑中否定的含义,将条件命题中的否定理解为其对推理规则的阻碍作用,结果命题中的否定理解为规则中的前提条件阻碍该命题的发生.在此基础上提出一种新的适合于含有否定命题逻辑规则的一致性FPN模型(Consistent Fuzzy Petri Net,CFPN)表示方法,同时在CFPN模型中引入域值的概念,并给出相应的形式化推理算法及相关证明.Fuzzy Petri Net （FPN） is an extension of Petfi Net （PN）. Previous research focuses on the representation and reasoning of the fuzzy rules with FPN. However, fuzzy production rules with negative literals can not be expressed and reasoned effectively in lraditional methods. The inherent meanings of the negative literals in fuzzy production rules are discussed in this paper, while negations of the input proposition can be represented as the negative impact on the rules, and negations of the consequents can be treated as that the rule blocks the consequents. Based on it,Consistent Fuzzy Petri Net （CFPN） model is proposed, which is more suitable to represent the fuzzy logic prograrrts with negations. Thresholds are also introduced to L-TPN model. Finally, a formal reasoning algorithm for the CFPN model is presented and validated.

关 键 词：模糊Petfi网 模糊逻辑推理 模糊产生式规则 否定命题 

分 类 号：TP302[自动化与计算机技术—计算机系统结构]