The associativity problem for owa operators
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 operators are not associative. and its application requires a...
| Autores: | , |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Fecha de publicación: | 1995 |
| País: | España |
| Institución: | Universidad Complutense de Madrid (UCM) |
| Repositorio: | Docta Complutense |
| Idioma: | inglés |
| OAI Identifier: | oai:docta.ucm.es:20.500.14352/60889 |
| Acceso en línea: | https://hdl.handle.net/20.500.14352/60889 |
| Access Level: | acceso abierto |
| Palabra clave: | Investigación operativa (Matemáticas) 1207 Investigación Operativa |
| Sumario: | 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 operators are not associative. and its application requires a previously fixed dimension, not to be modified. In this paper we develope the proposal given in [2], where each OWA operator was represented in terms of a family of binary OWA operators. A connective rule will be concectived here as a consistent family of connectives capable of solving arbitrary dimension problems. |
|---|