Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Concurrency, Specification and Programming (CS&P)
Guest editors: Ludwik Czaja, Wojciech Penczek and Krzysztof Stencel
Article type: Research Article
Authors: Suraj, Zbigniew* | Lasek, Agnieszka | Lasek, Piotr
Affiliations: Chair of Computer Science, Faculty of Mathematics and Natural Sciences, University of Rzeszów, Prof. S. Pigonia Str. 1, 35-310 Rzeszów, Poland. zbigniew.suraj@ur.edu.pl, lasek@ur.edu.pl, agnieszka.lasek@gmail.com
Correspondence: [*] Address for correspondence: Faculty of Mathematics and Natural Sciences, University of Rzeszów, Prof. S. Pigonia Str. 1, 35-310 Rzeszów, Poland
Abstract: In 1973 Lotfi Zadeh introduced the theory of fuzzy logic [17]. Fuzzy logic was an extension of Boolean logic so that it allowed using not only Boolean values to express reality. One kind of basic logical operations in fuzzy logic are so-called fuzzy implications. From over eight decades a number of different fuzzy implications have been described [3] - [16]. In the family of all fuzzy implications the partial order induced from [0,1] interval exists. Pairs of incomparable fuzzy implications can generate new fuzzy implications by using min(inf) and max(sup) operations. As a result the structure of lattice is created ([1], page 186). This leads to the following question: how to choose the correct functions among basic fuzzy implications and other generated as described above. In our paper, we propose a new method for choosing implications. Our method allows to compare two fuzzy implications. If the truth value of the antecedent and the truth value of the implication are given, by means of inverse fuzzy implications we can easily optimize the truth value of the implication consequent. In other words, we can choose the fuzzy implication, which has the greatest or the smallest truth value of the implication consequent or which has greater or smaller truth value than another implication. Primary results regarding this problem are included in the paper [14].
DOI: 10.3233/FI-2016-1309
Journal: Fundamenta Informaticae, vol. 143, no. 1-2, pp. 151-171, 2016
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl