Abstract
In this paper, we introduce a new construction method of a fuzzy implication from n increasing functions g i : [ 0 , 1 ] → [ 0 , ∞ ) , ( g ( 0 ) = 0 ) ( i = 1 , 2 , … , n , n ∈ ℕ ) and n + 1 fuzzy negations N i ( i = 1 , 2 , … , n + 1 , n ∈ ℕ ). Imagine that there are plenty of combinations between n increasing functions g i and n + 1 fuzzy negations N i in order to produce new fuzzy implications. This method allows us to use at least two fuzzy negations N i and one increasing function g in order to generate a new fuzzy implication. Choosing the appropriate negations, we can prove that some basic properties such as the exchange principle (EP), the ordering property (OP), and the law of contraposition with respect to N are satisfied. The worth of generating new implications is valuable in the sciences such as artificial intelligence and robotics. In this paper, we have found a novel method of generating families of implications. Therefore, we would like to believe that we have added to the literature one more source from which we could choose the most appropriate implication concerning a specific application. It should be emphasized that this production is based on a generalization of an important form of Yager’s implications.
Highlights
Fuzzy implications are the generalization of the classical (Boolean) implication in the interval of [0,1]
We studied certain properties of these new fuzzy implications, as the left neutrality property (14), exchange principle (15), identity principle (16), ordering property (17), law of contraposition (18), and T-Conditionality (32), where some results are
Let Iobtained be the fuzzy implication of Theorem
Summary
Fuzzy implications are the generalization of the classical (Boolean) implication in the interval of [0,1]. The production of new fuzzy implications is accomplished with the help of any fuzzy negations and increasing functions. These generated fuzzy implications fulfill the necessary properties required to be fuzzy implications (see [1] Definition 1.1.1.). If the negations are selected with certain properties, the generated implications may fulfill additional properties like the neutrality property (NP), exchange principle (EP), identity principle (IP), and some others. The worth of this production of implications could be estimated at artificial intelligence, robotics science, etc. We generalize our constructed method using n functions g1 , g2 , . . . , gn and n + 1 negations N1 , N2 , . . . , Nn , Nn+1
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.