Quasi-metrics and the semantics of logic programs
Fundamenta Informaticae
The Complexity of Tree Automata and Logics of Programs
SIAM Journal on Computing
On the aggregation of some classes of fuzzy relations
Technologies for constructing intelligent systems
Weighted aggregation operators based on minimization
Information Sciences: an International Journal
Denotational semantics for programming languages, balanced quasi-metrics and fixed points
International Journal of Computer Mathematics - Recent Advances in Computational and Applied Mathematics in Science and Engineering
Migrativity of aggregation functions
Fuzzy Sets and Systems
Fuzzy Sets and Systems
Generalized Distance Functions in the Theory of Computation
The Computer Journal
The average running time of an algorithm as a midpoint between fuzzy sets
Mathematical and Computer Modelling: An International Journal
Sequence spaces and asymmetric norms in the theory of computational complexity
Mathematical and Computer Modelling: An International Journal
Editorial: Modelling uncertainty
Information Sciences: an International Journal
Information Sciences: an International Journal
Aggregation functions: Construction methods, conjunctive, disjunctive and mixed classes
Information Sciences: an International Journal
On aggregation of normed structures
Mathematical and Computer Modelling: An International Journal
On quasi-metric aggregation functions and fixed point theorems
Fuzzy Sets and Systems
Asymmetric clustering using the alpha-beta divergence
Pattern Recognition
| Hi-index | 0.07 |
In this paper we provide a general description of how to combine a collection (not necessarily finite) of asymmetric distances in order to obtain a single one as output. To this end we introduce the notion of asymmetric distance aggregation function that generalizes the well-known one for distance spaces given by Borsik and Dobos [J. Borsik, J. Dobos, On a product of metricspaces, Math. Slovaca 31 (1981) 193-205]. Among other results, a characterization of such functions is obtained in terms of monotony and subadditivity. Finally, we relate our results to Computer Science. In particular we show that the mathematical formalism based on complexity distances, which has been introduced by Romaguera and Schellekens [S. Romaguera, M. Schellekens, Quasi-metric properties of complexity spaces, Topol. Appl. 98 (1999) 311-322] for the complexity analysis of programs and algorithms, can be obtained as a particular case of our new framework using appropriate asymmetric aggregation distance functions.