Catalogo Articoli (Spogli Riviste)
OPAC HELP
Titolo: FUZZY IMPLICATION CAN BE ARBITRARILY COMPLICATED  A THEOREM
Autore: FERNANDEZ FG; KREINOVICH V;
 Indirizzi:
 UNIV TEXAS,DEPT COMP SCI EL PASO TX 79968 UNIV TEXAS,DEPT COMP SCI EL PASO TX 79968
 Titolo Testata:
 International journal of intelligent systems
fascicolo: 5,
volume: 13,
anno: 1998,
pagine: 445  451
 SICI:
 08848173(1998)13:5<445:FICBAC>2.0.ZU;2F
 Fonte:
 ISI
 Lingua:
 ENG
 Tipo documento:
 Article
 Natura:
 Periodico
 Settore Disciplinare:
 CompuMath Citation Index
 Science Citation Index Expanded
 Citazioni:
 15
 Recensione:
 Indirizzi per estratti:



 Citazione:
 F.G. Fernandez e V. Kreinovich, "FUZZY IMPLICATION CAN BE ARBITRARILY COMPLICATED  A THEOREM", International journal of intelligent systems, 13(5), 1998, pp. 445451
Abstract
In fuzzy logic, there are several methods of representing implicationin terms of Br, V, and inverted left perpendicular; in particular, explicit representations define a class of S implications, implicit representations define a class of R implications. Some reasonable implication operations have been proposed, such as Yager's a(b), that are difficult to represent as S or R implications. For such operations, a new class of representations has recently been proposed, called A implications, for which the relationship between implications and the basic operations &, V, and inverted left perpendicular is even more complicated. A natural question is: Is this complexity really necessary? In other words, is it true that A operations cannot be described as S or R operations, or they can, but we simply have not found these representations? In this paper we show that yes, the complexity is necessary, because there are operations that cannot be represented in a simpler form. (C) 1998 John Wiley & Sons.
ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 25/11/20 alle ore 15:05:09