Geodesic
Program for generating fuzzy logical operations and its use in mathematical proofs
Kybernetika, Tome 38 (2002) no. 3, pp. 235-244 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Fuzzy logic is one of the tools for management of uncertainty; it works with more than two values, usually with a continuous scale, the real interval $[0,1]$. Implementation restrictions in applications force us to use in fact a finite scale (finite chain) of truth degrees. In this paper, we study logical operations on finite chains, in particular conjunctions. We describe a computer program generating all finitely-valued fuzzy conjunctions ($t$-norms). It allows also to select these $t$-norms according to various criteria. Using this program, we formulated several conjectures which we verified by theoretical proofs, thus obtaining new mathematical theorems. We found out several properties of $t$-norms that are quite surprising. As a consequence, we give arguments why there is no “satisfactory" finitely-valued conjunction. Such an operation is desirable, e. g., for search in large databases. We present an example demonstrating both the motivation and the difficulties encountered in using many-valued conjunctions. As a by-product, we found some consequences showing that the characterization of diagonals of finitely-valued conjunctions differs substantially from that obtained for $t$-norms on $[0,1]$.
Fuzzy logic is one of the tools for management of uncertainty; it works with more than two values, usually with a continuous scale, the real interval $[0,1]$. Implementation restrictions in applications force us to use in fact a finite scale (finite chain) of truth degrees. In this paper, we study logical operations on finite chains, in particular conjunctions. We describe a computer program generating all finitely-valued fuzzy conjunctions ($t$-norms). It allows also to select these $t$-norms according to various criteria. Using this program, we formulated several conjectures which we verified by theoretical proofs, thus obtaining new mathematical theorems. We found out several properties of $t$-norms that are quite surprising. As a consequence, we give arguments why there is no “satisfactory" finitely-valued conjunction. Such an operation is desirable, e. g., for search in large databases. We present an example demonstrating both the motivation and the difficulties encountered in using many-valued conjunctions. As a by-product, we found some consequences showing that the characterization of diagonals of finitely-valued conjunctions differs substantially from that obtained for $t$-norms on $[0,1]$.
Classification : 03B52, 03E72, 28E10, 68T37
Keywords: $t$-norm; finitely valued conjunction 
@article{KYB_2002_38_3_a1,
     author = {Bartu\v{s}ek, Tom\'a\v{s} and Navara, Mirko},
     title = {Program for generating fuzzy logical operations and its use in mathematical proofs},
     journal = {Kybernetika},
     pages = {235--244},
     year = {2002},
     volume = {38},
     number = {3},
     mrnumber = {1944306},
     zbl = {1265.28041},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_2002_38_3_a1/}
}
TY  - JOUR
AU  - Bartušek, Tomáš
AU  - Navara, Mirko
TI  - Program for generating fuzzy logical operations and its use in mathematical proofs
JO  - Kybernetika
PY  - 2002
SP  - 235
EP  - 244
VL  - 38
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/KYB_2002_38_3_a1/
LA  - en
ID  - KYB_2002_38_3_a1
ER  - 
%0 Journal Article
%A Bartušek, Tomáš
%A Navara, Mirko
%T Program for generating fuzzy logical operations and its use in mathematical proofs
%J Kybernetika
%D 2002
%P 235-244
%V 38
%N 3
%U http://geodesic.mathdoc.fr/item/KYB_2002_38_3_a1/
%G en
%F KYB_2002_38_3_a1
Bartušek, Tomáš; Navara, Mirko. Program for generating fuzzy logical operations and its use in mathematical proofs. Kybernetika, Tome 38 (2002) no. 3, pp. 235-244. http://geodesic.mathdoc.fr/item/KYB_2002_38_3_a1/

[1] Bartušek T.: Fuzzy Operations on Finite Sets of Truth Values (in Czech). Diploma Thesis, Czech Technical University, Praha 2001

[2] Baets B. De, Mesiar R.: Triangular norms on product lattices. Fuzzy Sets and Systems 104 (1999), 61–75 | DOI | MR | Zbl

[3] Baets B. De, Mesiar R.: Discrete triangular norms. In: Topological and Algebraic Structures (E. P. Klement and S. Rodabaugh, eds.), Universität Linz 1999, pp. 6–10

[4] Baets B. De, Mesiar R.: Discrete triangular norms. In: Topological and Algebraic Structures in Fuzzy Sets: Recent Developments in the Mathematics of Fuzzy Sets (S. Rodabaugh and E. P. Klement, eds.). Kluwer Academic Publishers, 2002, to appear | MR | Zbl

[5] Drossos C., Navara M.: Matrix composition of t-norms. In: Enriched Lattice Structures for Many-Valued and Fuzzy Logics (S. Gottwald and E. P. Klement, eds.), Univ. Linz 1997, pp. 95–100

[6] Godo L., Sierra C.: A new approach to connective generation in the framework of expert systems using fuzzy logic. In: Proc. 11th Internat. Symposium on Multiple–Valued Logic, IEEE Computer Society Press, Palma de Mallorca 1988, pp. 157–162

[7] Klement E. P., Mesiar, R., Pap E.: Triangular Norms. Kluwer, Dordrecht – Boston – London 2000 | MR | Zbl

[8] Mayor G., Torrens J.: On a class of operators for expert systems. Internat. J. Intell. Syst. 8 (1993), 771–778 | DOI | Zbl

[9] Mamdani E. H., Assilian S.: An experiment in linguistic synthesis with a fuzzy logic controller. J. Man-Machine Stud. 7 (1975), 1–13 | DOI | Zbl

[10] Mesiar R., Navara M.: Diagonals of continuous triangular norms. Fuzzy Sets and Systems 104 (1999), 34–41 | DOI | MR | Zbl

[11] Moser B., Navara M.: Conditionally firing rules extend the possibilities of fuzzy controllers. In: Proc. Internat. Conf. Computational Intelligence for Modelling, Control and Automation (M. Mohammadian, ed.), IOS Press, Amsterdam 1999, pp. 242–245 | Zbl

[12] Viceník P.: A note to a construction of t-norms based on pseudo-inverses of monotone functions. Fuzzy Sets and Systems 104 (1999), 15–18 | DOI | MR | Zbl