|Topic:||Algorithm to generate operations in many-valued logic|
|Supervisor:||Milan Petrík Garant: , Prof. Ing. Mirko Navara DrSc.|
|Description:||The aim is a program admitting the study of fuzzy conjunctions with values in a finite set of truth values.|
|Instruction:||Write an implementation of the algorithm described in "Rees
coextensions of finite, negative tomonoids" in C or in C++. The output of the
program shall be a text file describing all the possible fuzzy conjunctions up
to the given size. An important part of the implementation is an optimization
of the code. The program is supposed to be run on the Linux operating system.
|Bibliography:||H.T. Nguyen and E. Walker. A First Course in Fuzzy Logic. Chapman & Hall/CRC, Boca Raton, 2nd edition, 2000.
M. Petrík and T. Vetterlein: Rees coextensions of finite, negative tomonoids.
Journal of Logic and Computation, 2015.
|Realization form:||code in C or C++|