Linguistic hedges and the generalized modus ponens
✍ Scribed by Luigi Di Lascio; Antonio Gisolfi; Ulises Cortés Garcìa
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 167 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0884-8173
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper a modification of the generalized modus ponens is presented, namely, rule: if X is bB then Y is cC; fact: X is aB, conclusion: Y is dC where a, b, c, e, and d are linguistic hedges, and B, C are fuzzy sets. The procedure that allows one to evaluate the modifier d is very simple and gives results given in Refs. 15, 18, 26, and 27. Our approach is algebraic-based and realizes Zadeh's calculus on words by means of Chang's MV algebra.
📜 SIMILAR VOLUMES
## Abstract This paper studies, with techniques of Abstract Algebraic Logic, the effects of putting a bound on the cardinality of the set of side formulas in the Deduction Theorem, viewed as a Gentzen‐style rule, and of adding additional assumptions inside the formulas present in Modus Ponens, view
Fuzzy modus ponens (briefly, FMP) is the most fundamental form of fuzzy reasoning and has been extensively discussed by diverse researchers. The aim of the present paper is to propose a formalized form of FMP, called generalized modus ponens, in the fuzzy logic system L \* and solve it in L \* , and