首页 | 本学科首页   官方微博 | 高级检索  
     检索      

格值命题逻辑系统L_(2n+1)P(X)中基于半正则广义文字的自动推理算法
引用本文:李晓冰,邱小平,徐扬.格值命题逻辑系统L_(2n+1)P(X)中基于半正则广义文字的自动推理算法[J].模糊系统与数学,2009,23(4).
作者姓名:李晓冰  邱小平  徐扬
作者单位:1. 西南交通大学,智能控制开发中心,四川,成都,610031
2. 西南交通大学,物流学院,四川,成都,610031
基金项目:国家自然科学基金资助项目,高等学校博士学科点专项科研基金资助项目 
摘    要:在格值命题逻辑系统L2n+1P(X)上,提出了半正则的正广义文字和半正则的负广义文字的概念,进一步给出了半正则广义子句和半正则广义子句集的定义,详细地讨论了L2n+1P(X)上以中界元M为归结水平的半正则广义文字之间的M-归结性,最后,给出了L2n+1P(X)上基于半正则广义文字的归结水平为M的归结自动推理算法,并验证了其可靠性和完备性.

关 键 词:半正则的广义文字  中界元  格值命题逻辑系统  归结自动推理  自动推理算法

Automated Reasoning Algorithm Based on Sub-regular Generalized literals of Lattice-valued Propositional Logic L_(2n+1)P(X)
LI Xiao-bing,QIU Xiao-ping,XU Yang.Automated Reasoning Algorithm Based on Sub-regular Generalized literals of Lattice-valued Propositional Logic L_(2n+1)P(X)[J].Fuzzy Systems and Mathematics,2009,23(4).
Authors:LI Xiao-bing  QIU Xiao-ping  XU Yang
Institution:1.Intelligent Control Development Center;Southwest Jiaotong University;Chengdu 610031;China;2.College of Logistics;China
Abstract:In this paper,definitions of sub-regular positive generalized literal and sub-regular negative generalized literals in lattice-valued propositional logic L2n+1P(X) are given.Furthermore,definitions of sub-regular generalized clause and sub-regular generalized clause set are proposed.Then M-resolvent between sub-regular generalized literals is investigated.Based on above discussion,an automated reasoning algorithm is given and its soundness and completeness are proved.
Keywords:Sub-regular Generalized Literal  Intermediate Element  Lattice-valued Propositional Logic System  Resolution Automated Reasoning  Automated Reasoning Algorithm  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号