Optimal Solutions Based on Sustentation Degree for Problems of Generalized Modus Ponens
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In order to put fuzzy reasoning into the framework of logic and lays a solid logical foundation for fuzzy reasoning both syntactically and semantically,this paper transforms FMP(fuzzy modus ponens)into GMP (generalized modus ponens)by formalizing fuzzy reasoning and transplanting it into the classical propositional logic.Base on the concept of truth degrees of formulas,the sustentation degrees between formulas are put forward and a new kind of optimal solving mechanism is established for GMP and CGMP(collective generalized modus ponens).Existence theorems of optimal solutions are proved both for GMP and CGMP,and it is pointed out that there exists a completely similar reasoning mechanism between the classical propositional logic and the fuzzy logic. The graded method presented in this paper makes the algorithmic realization of solution procedure possible and serves as a guideline for the graded reasoning about knowledge.

    Reference
    Related
    Cited by
Get Citation

李骏,王国俊.基于支持度理论的广义Modus Ponens问题的最优解.软件学报,2007,18(11):2712-2718

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 19,2006
  • Revised:November 03,2006
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063