2026-06-08T13:40:03Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/181682024-11-26T15:11:19Zcom_20.500.14352_14col_20.500.14352_15

Montero De Juan, Francisco Javier González Del Campo Rodríguez Barbero, Ramón Garmendia Salvador, Luis Gómez González, Daniel Rodríguez González, Juan Tinguaro 2023-06-17T22:10:21Z 2023-06-17T22:10:21Z 2017-10-07 Montero, J., González-del-Campo, R., Garmendia, L., Gómez, D., Rodríguez, J.T.: Computable aggregations. Information Sciences. 460-461, 439-449 (2018). https://doi.org/10.1016/j.ins.2017.10.012 0020-0255 10.1016/j.ins.2017.10.012 https://hdl.handle.net/20.500.14352/18168 https//doi.org/10.1016/j.ins.2017.10.012 http://www.sciencedirect.com/science/article/pii/S0020025517310058 In this paper, we postulate computation as a key element in assuring the consistency of a family of aggregation functions so that such a family of operators can be considered an aggregation rule. In particular, we suggest that the concept of an aggregation rule should be defined from a computational point of view, focusing on the computational properties of such an aggregation, i.e., on the manner in which the aggregation values are computed. The new algorithmic definition of aggregation we propose provides an operational approach to aggregation, one that is based upon lists of variable length and that produces a solution even when portions of data are inserted or deleted. Among other advantages, this approach allows the construction of different classifications of aggregation rules according to the programming paradigms used for their computation or according to their computational complexity. eng open access Computable Aggregations journal article