Información de la editorial
International Fuzzy Systems Association |
Documentos disponibles de esta editorial (2)
![](./images/expand_all.gif)
![](./images/collapse_all.gif)
![Selecciones disponibles](./images/orderby_az.gif)
![]()
texto impreso
As shown by Fodor, Ovchinikov and Roubens [3,4,7,14], a binary preference relation should be always understood as a structure which explicits how strict preference, infidifference, weak preference and even incomparability are defined. Some parti[...]![]()
texto impreso
Connectives are usually assumed associative. Associativity allows recursive applica-tion of the same binary connective. in such a way that memorizing only one binary connective is enought. no matter the dimension of the real problem. OWA operat[...]