Copula-like operations on finite settings

This paper deals with discrete copulas considered as a class of binary aggregation operators on a finite chain. A representation theorem by means of permutation matrices is given. From this characterization, we study the structure of associative discrete copulas and a theorem of decomposition of any discrete copula in terms of associative discrete copulas is obtained. Finally, some aspects concerning their extension to copulas are dealt with.

[1]  M. Sklar.  Fonctions de repartition a n dimensions et leurs marges , 1959 .

[2]  Joan Torrens,et al.  On a class of operators for expert systems , 1993, Int. J. Intell. Syst..

[3]  E. T. Olsen,et al.  Copulas and Markov processes , 1992 .

[4]  János C. Fodor,et al.  Smooth associative operations on finite ordinal scales , 2000, IEEE Trans. Fuzzy Syst..

[5]  Radko Mesiar,et al.  Triangular Norms , 2000, Trends in Logic.

[6]  Radko Mesiar,et al.  Triangular norms on product lattices , 1999, Fuzzy Sets Syst..

[7]  C. Sierra,et al.  A new approach to connective generation in the framework of expert systems using fuzzy logic , 1988, [1988] Proceedings. The Eighteenth International Symposium on Multiple-Valued Logic.

[8]  R. Nelsen.  An Introduction to Copulas , 1998 .