计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (1): 37-38.DOI: 10.3778/j.issn.1002-8331.2010.01.012

• 研究、探讨 • 上一篇    下一篇

命题逻辑中广义MP问题的合理解

李 骏1,李彩红1,周 艳2   

  1. 1.兰州理工大学 理学院,兰州 730050
    2.西安陆军学院 科学文化基础教研室,西安 710108
  • 收稿日期:2009-01-12 修回日期:2009-03-13 出版日期:2010-01-01 发布日期:2010-01-01
  • 通讯作者: 李 骏

Reasonable solutions for generalized MP problems in propositional logic

LI Jun1,LI Cai-hong1,ZHOU Yan2   

  1. 1.School of Science,Lanzhou University of Technology,Lanzhou 730050,China
    2.S & C Basics Teaching and Research Section,Xi’an Military Academy,Xi’an 710108,China
  • Received:2009-01-12 Revised:2009-03-13 Online:2010-01-01 Published:2010-01-01
  • Contact: LI Jun

摘要: 在经典命题逻辑中基于公式的真度概念提出了公式之间的支持度,利用支持度的思想引入了广义MP问题的一种新型合理求解机制,并证明了合理解的存在性。

关键词: GMP问题, 真度, 支持度, 合理解

Abstract: By means of truth degrees of formulas,this paper puts forward a new concept of sustentation degree among formulas in classical propositional logic.Reasonable solution based on the idea of sustentation degree for problems of generalized modus ponens is introduced,and the existence theorem of reasonable solutions is proved.

Key words: GMP problem, truth degrees, sustentation degree, reasonable solution

中图分类号: