<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Inverted fuzzy implications in approximate reasoning</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Chair of Computer Science, Faculty of Mathematics and Natural Sciences, University of Rzeszow</institution>
          ,
          <country country="PL">Poland</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this 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.</p>
      </abstract>
      <kwd-group>
        <kwd>fuzzy logic</kwd>
        <kwd>fuzzy implications</kwd>
        <kwd>inverted fuzzy implications</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        In 1975 Lotfi Zadeh introduced the theory of fuzzy logic [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Fuzzy logic was
an extension of Boolean logic so that it allowed using not only Boolean values
to express reality. One of basic logical operations in fuzzy logic are so-called
implications. From over eight decades a number of different fuzzy implications
have been proposed [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]-[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. In the family of basic fuzzy implications the partial
order induced from [
        <xref ref-type="bibr" rid="ref1">0,1</xref>
        ] 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 ([
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], page 186). This leads to
the following question: how to choose the relevant 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 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 [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>
        The rest of this paper is organized as follows. In Sect. 2 the main research
problem is formulated. Sect. 3 presents the solution of the given research
problem. An example illustrating our approach is given in Sect. 4. Sect. 5 includes
remarks on directions for further research.
There is given a basic fuzzy implication z = I(x; y), where x, y belong to [
        <xref ref-type="bibr" rid="ref1">0,1</xref>
        ].
x is the truth value of the antecedent and is known. z is the truth value of
the implication and is also known. In order to determine the value of the truth
of the implication’s consequent y it is needed to compute the inverse function
InvI(x; z). In other words, the inverse function InvI(x; z) has to be determined.
Not every basic implication can be inverted. The function can be inverted only
when it is injective.
      </p>
      <p>There are a few examples of basic fuzzy implications in Table 1.
3</p>
    </sec>
    <sec id="sec-2">
      <title>Results</title>
      <sec id="sec-2-1">
        <title>Name</title>
      </sec>
      <sec id="sec-2-2">
        <title>Lukasiewicz Godel</title>
      </sec>
      <sec id="sec-2-3">
        <title>Reichenbach</title>
      </sec>
      <sec id="sec-2-4">
        <title>Kleene-Dienes</title>
      </sec>
      <sec id="sec-2-5">
        <title>Goguen</title>
      </sec>
      <sec id="sec-2-6">
        <title>Rescher</title>
      </sec>
      <sec id="sec-2-7">
        <title>Yager</title>
      </sec>
      <sec id="sec-2-8">
        <title>Weber</title>
      </sec>
      <sec id="sec-2-9">
        <title>Fodor</title>
        <p>
          Year
1923, [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]
Table 2 lists inverse fuzzy implications and their domains.
        </p>
        <p>
          The resulting inverse functions can be compared with each other so that it
is possible to order them. However, some of those functions are incomparable in
the whole domain. Nevertheless, by dividing the domain into separable areas (see
Figure 1), we have obtained the below given inequalities for any x; z belonging to
(0,1). The interval to which x and z belong to is open, since we did not manage
to deduce any inequalities on the edges of the domain. From the definition of a
fuzzy implication ([
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], page 2) we can conclude that every fuzzy implication I is
constant for x = 0 and also for y = 1, i.e., I(0; y) = 1 for y 2 [0; 1], and I(x; 1) = 1
for x 2 [0; 1]: So, one can not infer any inequality on the edges x = 0 and z =
1. For the edge z = 0 the following functions exist: InvIGD, InvIGG, InvIY G.
        </p>
      </sec>
      <sec id="sec-2-10">
        <title>Formula of inverted fuzzy implication</title>
        <p>InvILK(x; z) = z + x 1
InvIGD(x; z) = z
InvIRC(x; z) = z+x 1</p>
        <p>x
InvIKD(x; z) = z
InvIGG(x; z) = xz</p>
        <p>1
InvIY G(x; z) = z x
InvIF D(x; z) = z
Values of those functions on this edge are equal to zero, hence, no inequality
can be inferred from them. Likewise, on the edge x = 1 the inverse functions are
InvILK , InvIGD, InvIRC , InvIKD, InvIGG, InvIY G, InvIF D. Values of these
functions are equal z on this edge. For this reason it is not possible to infer any
inequality.
4. For z &lt; 1 x and z &gt; x 1 xx</p>
        <p>InvIGG &lt; InvIY G
3. For z &gt; 1 x and z &lt; x 1 xx</p>
        <p>InvILK &lt; InvIRC &lt; InvIY G &lt; InvIGG &lt; InvIGD = InvIKD = InvIF D
5. For z &gt; 1 x and z x and z &lt; 1+1x</p>
        <p>InvILK &lt; InvIRC &lt; InvIGG &lt; InvIY G &lt; InvIKD
6. For z &gt; x 1 xx and z &lt; 1 x and z &lt; 1+1x</p>
        <p>InvILK &lt; InvIRC &lt; InvIGG &lt; InvIY G &lt; InvIKD = InvIGD = InvIF D
7. For z &gt; 1+1x and z x</p>
        <p>InvILK &lt; InvIGG &lt; InvIRC &lt; InvIY G &lt; InvIKD
8. For z &gt; 1+1x and z &lt; x</p>
        <p>InvILK &lt; InvIGG &lt; InvIRC &lt; InvIY G &lt; InvIKD = InvIGD = InvIF D
9. For z = 1 x and x 2 (0; 12 )</p>
        <p>InvILK = InvIRC &lt; InvIGG &lt; InvIY G
10. For z = 12 and x = 12</p>
        <p>InvILK = InvIRC &lt; InvIGG = InvIY G
11. For z = 1 x and x 2 ( 21 ; 1)</p>
        <p>InvILK = InvIRC &lt; InvIY G &lt; InvIGG &lt; InvIGD
12. For z = x 1 xx and x 2 (0; 21 )</p>
        <p>InvIY G = InvIGG
13. For z = x 1 xx and x 2 ( 21 ; 1)</p>
        <p>InvILK &lt; InvIRC &lt; InvIY G = InvIGG &lt; InvIGD = InvIKD = InvIF D
14. For z = 1+1x and x 2 (0; 1)</p>
        <p>InvILK &lt; InvIRC = InvIGG &lt; InvIY G &lt; InvIKD</p>
        <p>By means of these inequalities it is possible to find a fuzzy implication which
has, for example, the greatest or the smallest truth value of a consequent y
whereas the truth value of the antecedent x and the truth value of the implication
z are given. First, it should be checked to which area of the domain the point
(x; z) belongs. It is one of the areas 1 - 14. Then, according to the inequality
in the given area, the function of the smallest or the greatest truth value of the
consequent InvI(x; z) can be selected.</p>
        <p>
          Then, wanting to expand the set of tested fuzzy implications we have started
to study new fuzzy implications H1 H15 generated from the basic fuzzy
implications, which form an algebraic structure of lattice ([
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], pages 184-185). Below
given functions H1 H15 are presented in one or two forms. The first form is
taken from [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], while the second version is the transformation of the first to a
form which is composed of pieces that are basic functions. It turned out that the
inverses of fuzzy implications H1 H15 are equal to the inverses of basic fuzzy
implications in various areas of the unit square.
        </p>
        <p>{ 1 if x y
H1(x; y) = max( xy ; 1 x + xy) if x &gt; y</p>
        <p> 1
H1(x; y) =  y</p>
        <p>x
 1
if x y
if x &gt; y
x + xy if y &lt; 1+xx</p>
        <p>x
1+x
H2(x;y) = {1 x + xy if x y</p>
        <p>min(xy;1 x + xy) if x &gt; y
H11(x; y) =
H12(x; y) =
H12(x; y) =
H13(x; y) =
H13(x; y) =
H14(x; y) =
H15(x; y) =
H15(x; y) =
 y
 1x
 y
 1
 1
 xy
 1
 1
In order to illustrate our approach, let us describe a simple example coming from
the domain of train traffic control. We consider the following situation: a train B
waits at a certain station for a train A to arrive in order to allow some passengers
to change train A to train B. Now, a conflict arises when the train A is late. In
this situation, the following alternatives can be taken into consideration:
1. Train B waits for train A to arrive. In this case, train B will depart with
delay.
2. Train B departs in time. In this case, passengers disembarking train A have
to wait for a later train.
3. Train B departs in time, and an additional train is employed for the train
A passengers.</p>
        <p>To make a decision, several inner conditions have to be taken into account
such as the delay period, the number of passengers changing trains, etc. The
discussion regarding an optimal solution to the problem of divergent aims such
as: minimization of delays throughout the traffic network, warranty of
connections for the customer satisfaction, efficient use of expensive resources, etc. is
disregarded at this point. In order to describe the traffic conflict, we propose to
consider the following three IF-THEN fuzzy rules:
{ r1: IF s2 OR s3 THEN s6
{ r2: IF s1 AND s4 AND s6 THEN s7
{ r3: IF s4 AND s5 THEN s8
where:
{ s1: ’Train B is the last train in this direction today’,
{ s2: ’The delay of train A is huge’,
{ s3: ’There is an urgent need for the track of train B’,
{ s4: ’Many passengers would like to change for train B’,
{ s5: ’The delay of train A is short’,
{ s6: ’(Let) train B depart according to schedule’,
{ s7: ’Employ an additional train C (in the same direction as train B)’, and
{ s8: ’Let train B wait for train A’.</p>
        <p>In the further considerations we accept the following assumptions:
1. The logical operators OR, AND we interpret as max and min fuzzy
operators, respectively.
2. The statements s1, s2, s3, s4 and s5 we assign the fuzzy values 0.6, 0.4, 0.7,
0.5 and 1, respectively.
3. The truth-values of rules r1; r2 and r3 are equal to 0.6, 0.7, 0.8, respectively.
4. The threshold values for three rules are equal to 0.1.
5. Each of rules r1, r2 and r3, firstly, we interpret as the Lukasiewicz
implication.</p>
        <p>Assessing the statements from s1 up to s5, we observe that the rule r1 and r3
can be fired (activated). Firing these rules according to the above assumptions
allows computation of the support for the alternatives in question. In this way,
the possible alternatives are ordered with regard to the preference they achieve
from the knowledge base. This order forms the basis for further examinations
and simulations and, ultimately, for the dispatching proposal. If one chooses a
sequence of rules r1; r2 then they obtain the final value, corresponding to the
statement s7, equal to 0. In the other case (i.e., for the rule r3 only), the final
value, this time corresponding to the statement s8, equals 0.3. Secondly, if we
interpret these three rules as the Reichenbach implications, and if we choose
the same sequences of transitions as above we obtain the final values for the
statements s7 and s8 equal to 0.3, 0.6, respectively. Thirdly, if we execute the
similar simulation of approximate reasoning for three rules considered above and,
if we interpret the rules as the Kleene-Dienes implications we obtain the final
values for s7 and s8 equal to 0.7, 0.8, respectively. This example shows clearly
that different interpretations for the rules may lead to quite different decision
results. Nevertheless, they are conformable with the relationships between
inverted fuzzy implication functions presented above (see, for example, items 3,
5-8, 13-14). Choosing a suitable interpretation for fuzzy implications we may try
to obtain the optimal final values for decisions s7 and s8. The rest in this case
certainly depends on the experience of the decision support system designer to
a significant degree.
5</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Conclusion and Further Research</title>
      <p>In this paper, we presented an approach to finding the fuzzy implication which
has for example the largest or the smallest truth value of the consequent when
the truth value of the antecedent and the truth value of the implication are
given.</p>
      <p>Our next problem to be solved is how to choose the fuzzy implication so
that the truth value of the antecedent is optimized at the given truth value of
implication’s conclusion and given value of truth of implication.
Acknowledgment. This work was partially supported by the Center for Innovation
and Transfer of Natural Sciences and Engineering Knowledge at the University
of Rzesz´ow.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Baczynski</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jayaram</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Fuzzy implications</article-title>
          ,
          <source>Studies in Fuzziness and Soft Computing</source>
          , Vol.
          <volume>231</volume>
          , Springer, Berlin 2008
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Dienes</surname>
            ,
            <given-names>Z.P.</given-names>
          </string-name>
          :
          <article-title>On an implication function in many-valued systems of logic</article-title>
          .
          <source>J. Symb. Logic</source>
          <volume>14</volume>
          ,
          <fpage>95</fpage>
          -
          <lpage>97</lpage>
          (
          <year>1949</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Fodor</surname>
            ,
            <given-names>J.C.</given-names>
          </string-name>
          :
          <article-title>On contrapositive symmetry of implications in fuzzy logic</article-title>
          .
          <source>In: Proc. 1st European Congress on Fuzzy and Inteligent Technologies (EUFIT</source>
          <year>1993</year>
          ), pp.
          <fpage>1342</fpage>
          -
          <lpage>1348</lpage>
          . Verlag der Augustinus Buchhandlung,
          <string-name>
            <surname>Aachen</surname>
          </string-name>
          (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4. Godel, K.:
          <article-title>Zum intuitionistischen Aussagenkalkul</article-title>
          . Auzeiger der Akademie der Wissenschaften in Wien, Mathematisch,
          <source>naturwissenschaftliche Klasse 69</source>
          ,
          <fpage>65</fpage>
          -
          <lpage>66</lpage>
          (
          <year>1932</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Goguen</surname>
            ,
            <given-names>J.A.:</given-names>
          </string-name>
          <article-title>The logic of inexact concepts</article-title>
          .
          <source>Synthese</source>
          <volume>19</volume>
          ,
          <fpage>325</fpage>
          -
          <lpage>373</lpage>
          (
          <year>1969</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kleene</surname>
            ,
            <given-names>S.C.</given-names>
          </string-name>
          :
          <article-title>On a notation for ordinal numbers</article-title>
          .
          <source>J. Symb. Logic</source>
          <volume>3</volume>
          ,
          <fpage>150</fpage>
          -
          <lpage>155</lpage>
          (
          <year>1938</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Lukasiewicz</surname>
          </string-name>
          , J.:
          <article-title>Interpretacja liczbowa teorii zdan</article-title>
          .
          <source>Ruch Filozo czny 7</source>
          ,
          <fpage>92</fpage>
          -
          <lpage>93</lpage>
          (
          <year>1923</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Reichenbach</surname>
          </string-name>
          , H.:
          <source>Wahrscheinlichkeitslogik. Erkenntnis</source>
          <volume>5</volume>
          ,
          <fpage>37</fpage>
          -
          <lpage>43</lpage>
          (
          <year>1935</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Rescher</surname>
          </string-name>
          , N.:
          <article-title>Many-valued logic</article-title>
          .
          <source>McGraw-Hill</source>
          , New York (
          <year>1969</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Suraj</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Toward optimization of approximate reasoning based on rule knowledge (to appear)</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Weber</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>A general concept of fuzzy connectives, negations and implications based on t-norms and t-conorms</article-title>
          .
          <source>Fuzzy Sets and Systems</source>
          <volume>11</volume>
          ,
          <fpage>115</fpage>
          -
          <lpage>134</lpage>
          (
          <year>1983</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Yager</surname>
            ,
            <given-names>R.R.:</given-names>
          </string-name>
          <article-title>An approach to inference in approximate reasoning</article-title>
          .
          <source>Int. J. ManMachine Studies</source>
          <volume>13</volume>
          ,
          <fpage>323</fpage>
          -
          <lpage>338</lpage>
          (
          <year>1980</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Zadeh</surname>
            ,
            <given-names>L.A.</given-names>
          </string-name>
          :
          <article-title>Fuzzy logic and approximate reasoning</article-title>
          . Synthese, APRIL/MAY
          <year>1975</year>
          , Vol.
          <volume>30</volume>
          ,
          <string-name>
            <surname>Issue</surname>
          </string-name>
          3-
          <issue>4</issue>
          ,
          <fpage>407</fpage>
          -
          <lpage>428</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>