<!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>Approximate Reasoning with Fuzzy-Syllogistic Systems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Bora İ Kumova</string-name>
          <email>borakumova@iyte.edu.tr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>İzmir Institute of Technology; Department of Computer Engineering;</institution>
          <addr-line>35430</addr-line>
          <country country="TR">Turkey</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2015</year>
      </pub-date>
      <fpage>55</fpage>
      <lpage>62</lpage>
      <abstract>
        <p>The well known Aristotelian syllogistic system consists of 256 moods. We have found earlier that 136 moods are distinct in terms of equal truth ratios that range in τ=[0,1]. The truth ratio of a particular mood is calculated by relating the number of true and false syllogistic cases the mood matches. A mood with truth ratio is a fuzzy-syllogistic mood. The introduction of (n-1) fuzzy existential quantifiers extends the system to fuzzy-syllogistic systems n , 1&lt;n, of which every fuzzy-syllogistic mood can be interpreted as a vague inference with a generic truth ratio that is determined by its syllogistic structure. We experimentally introduce the logic of a fuzzy-syllogistic ontology reasoner that is based on the fuzzy-syllogistic systems n . We further introduce a new concept, the relative truth ratio rτ=[0,1] that is calculated based on the cardinalities of the syllogistic cases.</p>
      </abstract>
      <kwd-group>
        <kwd />
        <kwd>Syllogistic reasoning</kwd>
        <kwd>fuzzy logic</kwd>
        <kwd>approximate reasoning</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        Multi-valued logics were initially introduced by Łukasiewicz [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], as an extension
to propositional logic. After Zadeh generalised multi-valued logics within fuzzy logic
[
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], he discussed syllogistic reasoning with fuzzy quantifiers in the context of fuzzy
logic [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. However, this initial fuzzification of syllogistic moods was experimentally
applied on only a few true moods and did not systematically cover all moods. The
first systematic application of multi-valued logics on syllogisms were intermediate
quantifiers and their reflection on the square of opposition [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. However only
settheoretic representation of moods as syllogistic cases allow 64analysing the
fuzzysyllogistic systems n mathematically exactly, such as by calculating truth ratios of
moods [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and their algorithmic usage in fuzzy inferencing [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Here we present a
sample application of n for fuzzy-syllogistic ontology reasoning.
      </p>
      <p>
        Learning from scratch can be modelled probabilistically, as objects and their
relationships need to be first synthesised from a statistically significant number of
perceived instances of similar objects. This leads to probabilistic ontologies [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ],
[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], in which attributes of objects may be synthesised also as objects.
      </p>
      <p>
        There are more probabilistic ontology reasoners than fuzzy or possibilistic ones
and most of them reason with probabilist ontologies [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Several ontology reasoners
employ possibilistic logic and reason with fuzzy ontologies. The most popular
reasoning logic being hyper-tableau, for instance in HermiT [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Other experimental
reasoning logics are also interesting to analyse, such as fuzzy rough sets and
Łukasiewicz logic [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] in FuzzyDL [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], Zadeh and Gödel fuzzy operators in DeLorean
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], Mamdani inference in HyFOM [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] or possibilistic logic in KAON [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
Fuzzysyllogistic reasoning (FSR) can be seen as a generalisation of both, fuzzy-logical and
possibilistic reasoners.
      </p>
      <p>
        A fuzzy-syllogistic ontology (FSO) extends the concept of ontology with the
quantities that led to the ontological concepts. A FSO is usually generated
probabilistically, but does not preserve any probabilities like probabilistic ontologies
[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] or probabilistic logic networks [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] do. A FSO can be a fully connected and
bidirectional graph.
      </p>
      <p>
        Several generic reasoning logics are discussed in the literature, like probabilistic,
non-monotonic or non-axiomatic reasoning [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Fuzzy-syllogistic reasoning in its
basic form [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] is possibilistic, monotonic and axiomatic.
      </p>
      <p>
        Syllogistic reasoning reduced to the proportional inference rules deduction,
induction and abduction are employed in the Non-Axiomatic Reasoning System
(NARS) [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Whereas FSR uses the original syllogistic moods and their fuzzified
extensions [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ].
      </p>
      <p>
        There is one implementation mentioned in the literature that is close to the concept
of syllogistic cases: Syllogistic Epistemic REAsoner (SEREA) implements
polysyllogisms and generalised quantifiers that are associated with combinations of
distinct spaces, which are mapped onto some interval arithmetic. Reasoning is then
performed with concrete quantities, determined with the interval arithmetic [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
      <p>First the fuzzy-syllogistic systems n are discussed, thereafter fuzzy-syllogistic
reasoning is introduced, followed by its sample application on a fuzzy-syllogistic
ontology and the introduction of relative truth ratios rτ.
2</p>
    </sec>
    <sec id="sec-2">
      <title>FUZZY-SYLLOGISTIC SYSTEMS</title>
      <p>The fuzzy-syllogistic systems n , with 1&lt;n fuzzy quantifiers, extend the well
known Aristotelian syllogisms with fuzzy-logical concepts, like truth ratio for every
mood and fuzzy quantifiers or in general fuzzy sets. We discuss first the systems n
and introduce them further below as the basic reasoning logic of FSR.</p>
      <sec id="sec-2-1">
        <title>2.1 Aristotelian Syllogistic System </title>
        <p>The Aristotelian syllogistic system consists of inclusive existential quantifiers
ψ, ie I includes A and O includes E as one possible case:</p>
        <p>Universal affirmative: All S are P: ψ=A: {x| x∉P-S ∧ x∈P∩S}</p>
        <p>Universal negative: All S are not P: ψ=E: {x| x∈S-P ∧ x∉P-S}
Inclusive existential affirmative: Some S are P: ψ=I: A ∪ {x| (x∉S-P ∧ x∉P-S ∧
x∈P∩S) ∨ (x∉S-P ∧ x∈P∩S)}
Inclusive existential negative: Some S are not P: ψ=O: E ∪ {x| (x∈S-P ∧ x∉P-S
∧ x∉P∩S) ∨ (x∈S-P ∧ x∉P∩S)}</p>
        <p>A categorical syllogism ψ1ψ2ψ3F is an inference schema that concludes a
quantified proposition Φ3=Sψ3P from the transitive relationship of two given
quantified proportions Φ1={Mψ1P, Pψ1M} and Φ2={Sψ2M, Mψ2S}:
ψ1ψ2ψ3F = (Φ1={Mψ1P, Pψ1M}, Φ2={Sψ2M, Mψ2S}, Φ3=Sψ3P)</p>
        <p>where F={1, 2, 3, 4} identifies the four possible combinations of Φ1 with Φ2,
namely syllogistic figures. Every figure produces 43=64 moods and the whole
syllogistic system has 4x64=256 moods.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2 Syllogistic­Cases</title>
        <p>
          Syllogistic cases are an elementary concept of the fuzzy-syllogistic systems n ,
for calculating truth ratios [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] of the moods algorithmically [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ].
        </p>
        <p>
          For three sets, 7 distinct spaces δi, i=[
          <xref ref-type="bibr" rid="ref1 ref7">1,7</xref>
          ] are possible, which can be easily
identified in a Venn diagram (Table 1). There are in total j=96 distinct combinations of
the spaces Δj=δ1δ2δ3δ4δ5δ6δ7, j=[
          <xref ref-type="bibr" rid="ref1">1,96</xref>
          ] [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ], which constitute the universal set of
syllogistic moods. Out of this universe, we determine for every mood true and false
matching space combinations (Fig 1).
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3 Fuzzy­Syllogistic Moods</title>
        <p>
          We extend the ancient binary truth classification of moods, to a fuzzy
classification with truth values in [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ]. For this purpose, first the above set-theoretical
definitions of the quantifiers of a particular mood are compared against the set of all
syllogistic cases Δj, j=[
          <xref ref-type="bibr" rid="ref1">1,96</xref>
          ], in order to identify true and false matching cases:
True syllogistic cases: Λt = j=1∪96Δj∈(ΦΔ1∩ΦΔ2) →Δj∈ΦΔ3
        </p>
        <p>False syllogistic cases: Λf = j=1∪96Δj∈(ΦΔ1∩ΦΔ2) → Δj∉ΦΔ3
where Λt and Λf is the set of all true and false matching cases of a particular mood,
respectively (Fig 1) and ΦΔ is a proposition in terms of syllogistic cases. For instance,
the two premisses Φ1 and Φ2 of the mood IAI4 of the syllogistic system , match the
10 syllogistic cases Λt = {Δ4, Δ19, Δ67, Δ24, Δ43, Δ46, Δ68, Δ74, Δ48, Δ76}, which are all true
for the conclusion Φ3 as well. Thus the mood has no false cases Λf = Ø.</p>
        <p>The truth ratio of a mood is then calculated by relating the amounts of the two sets
Λt and Λf with each other. Consequently the truth ratio becomes either more true or
more false τ ∈ {τf, τt}:</p>
        <p>More true: τt ∈ {|Λf|&lt;|Λt| → 1-|Λf|/(|Λt|+|Λf|)} = [0.545,1]
More false: τf ∈ {|Λt|&lt;|Λf| → |Λt|/(|Λt|+|Λf|)} = [0,0.454]
where |Λt| and |Λf| are the numbers of true and false syllogistic cases, respectively.
A fuzzy-syllogistic mood is then defined by assigning an Aristotelian mood ψ1ψ2ψ3F
the structurally fixed truth ratio τ:</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Fuzzy-syllogistic mood: (ψ1ψ2ψ3F, τ)</title>
      <p>The truth ratio identifies the degree of truth of a particular mood, which we will
associate further below in fuzzy-syllogistic reasoning with generic vagueness of
inferencing with that mood.</p>
      <p>
        The analysis of the Aristotelian syllogistic system with these concepts reveals
several interesting properties, like has 136 distinct moods, 25 true moods τ=1, of
which 11 are distinct, and 25 false moods τ=0, of which 11 are distinct, and that is
almost point-symmetric on syllogistic cases and truth ratios of the moods [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
2.4 Fuzzy­Syllogistic System 2
      </p>
      <p>In the fuzzy-syllogistic system (FSS) 2 , the universal cases A and E are excluded
from the existential quantifiers I and O, respectively:</p>
      <p>Exclusive existential affirmative: Some S butNotAll are P: ψ=I: {x| (x∉S-P ∧
x∉P-S ∧ x∈P∩S) ∨ (x∉S-P ∧ x∈P∩S)}
Exclusive existential negative: Some S butNotAll are not P: ψ=O: {x| (x∈S-P ∧
x∉P-S ∧ x∉P∩S) ∨ (x∈S-P ∧ x∉P∩S)}</p>
      <p>
        For instance the mood IAI4 of , becomes 2/1IA1I4 in 2 . Because of the exclusive
existential quantifier 2/1I, the case Δ46 is no more matched by of the first premiss Φ1
and the conclusion Φ3 becomes false for the case Δ19 (Fig 1).
true: Δ4*=δ4δ6δ7
false: Δ19=δ2δ6δ7
true: Δ67=δ1δ2δ7
true: Δ24=δ2δ4δ6δ7
true: Δ43=δ1δ6δ7
true: Δ68=δ1δ2δ6δ7
true: Δ74=δ1δ2δ4δ7 true: Δ48=δ1δ4δ6δ7
* A full list of all syllogistic cases Δj, j=[
        <xref ref-type="bibr" rid="ref1">1,96</xref>
        ], can be found elsewhere [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ].
      </p>
      <p>Fig 1. 9 syllogistic cases Δj of the mood 2/1IA1I4 of the fuzzy-syllogistic systems 2 .
true: Δ76=δ1δ2δ4δ6δ7
...</p>
      <p>n/1I
* Column breadths are not drawn proportional to the overall value range and to the other quantifiers.</p>
      <p>
        The analysis of the FSS 2 shows that 2 has 70 distinct moods, 11 true moods
τ=1, of which 5 are distinct, and 40 false moods τ=0, of which 13 are distinct, and that
2 is not point-symmetric [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <sec id="sec-3-1">
        <title>2.5 Fuzzy­Syllogistic System n</title>
        <p>By using (n-1) fuzzy-existential quantifiers, the total number of fuzzy-syllogistic
moods of the FSS n increases to (2n)3. The sample mood IAI4 of can now be
generalised to n/k1IAk2I4, 1&lt;n, 0&lt;k1,k2&lt;n of n . n/k1IAk2I4 consists of (n-1)2
fuzzymoods, all having the very same 9 syllogistic cases (Fig 1).</p>
        <p>Same linguistic terms used in different FSSs do not necessarily equal each other.
For instance, "most" may have different value ranges in the FSSs 3 , 4 , 5 , 6 and
therefore are in general not equal 3/2I≠4/3I≠5/3I≠6/4I, respectively. Likewise for "half" in
4 and 6 the quantifiers may not exactly equal 4/2I≠6/3I, respectively (Table 2).
3</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>FUZZY-SYLLOGISTIC ONTOLOGY</title>
      <p>A fuzzy-syllogistic ontology (FSO) consists of concepts, their relationships and
assertions on them, whereby all quantities are given with fuzzy-quantifications:</p>
      <p>Fuzzy-syllogistic ontology: FSO=k(C, R, A)
where C is the set of all concepts, R is the set of all directed relationships between
the concepts and A is the set of all assertions. A FSO may be specified top-down or
may be transformed from any existing ontology, provided that all quantities are
determined systematically, in compliance with one of the FSSs k , 1&lt;k≤n, (Table 2).
In a bottom-up approach, a FSO may be learned from given domain data.</p>
      <sec id="sec-4-1">
        <title>3.1 Learning Fuzzy Quantifiers</title>
        <p>
          Although existing learning approaches generate ontological concepts and their
relationships through probabilistic analysis of the data [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], the quantities
that actually imply the concepts and relationships, are not preserved in the ontology
[
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. Therefore we sketch here briefly how to learn such quantities of a FSO.
        </p>
        <p>For any directly connected triple concept relationship of the FSO, seven distinct
relationships are possible (Table 1). The quantity of every such relationship has to be
stored with the FSO. Since the relationships may be bi-directional or a concept may
be involved in multiple triple relationships (Fig 2), the quantities of all these cases
need to be stored too.</p>
        <p>The objective of learning a FSO=k(C, R, A) is, to update the FSO against changing
domain data and to determined the most appropriate FSS k out of n , 1&lt;k≤n.</p>
      </sec>
      <sec id="sec-4-2">
        <title>3.2 Relative truth ratio</title>
        <p>Relative truth ratios are calculated from the exact quantities of all syllogistic cases
of a particular mood, rather than from just the amount of the cases:</p>
        <p>Relative true: rτt = λf&lt;λt → λf/(λf+λt)</p>
        <p>Relative false: rτf = λt&lt;λf → λt/(λt+λf)
where λt = j=1∑|Λt| |Δtj| and λf = j=1∑|Λf| |Δfj| is the total number of elements
accumulated over all true and false syllogistic cases, respectively. Where |Λt| and |Λf|
is the number of true and false cases of the mood, respectively. Accordingly, we can
re-define a fuzzy-syllogistic mood with relative truth ratio rτ:</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Fuzzy-syllogistic mood with relative truth ratio: (ψ1ψ2ψ3F, rτ)</title>
      <p>The structural truth ratio τ of a particular mood represents the generic vagueness
of the mood and is constant, whereas the relative truth ratio rτ adjusts τ by weighting
every case of the mood with its actual quantity.
4</p>
    </sec>
    <sec id="sec-6">
      <title>FUZZY-SYLLOGISTIC REASONING</title>
      <p>
        The fuzzy-syllogistic systems , 2 and 6 are currently implemented
experimentally as the reasoning logic of the fuzzy-syllogistic reasoner (FSR), for
reasoning over FSOs [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Our objective is to generalise the logic of the reasoner to
n and to use it as a cognitive primitive for modelling other cognitive concepts within
a cognitive architecture. We now sketch the algorithmic design of the FSR.
6/5
I=m
an
      </p>
      <p>y
6/1I=few
few</p>
      <sec id="sec-6-1">
        <title>Bicycle</title>
        <p>6/1 I=</p>
      </sec>
      <sec id="sec-6-2">
        <title>Sport</title>
      </sec>
      <sec id="sec-6-3">
        <title>Bicycle</title>
        <p>6/5
I=m
an</p>
        <p>y
6/1I=few
few
6/1 I=
6 : (6/4I1I1I1, 40/47=0.851) 6 : (6/5I1I1I2, 40/48=0.833)
Φ1: Most bicycles are good for children Φ1: Many children have bicycles
Φ2: Few sports are good for bicycles Φ2: Few sports are good for bicycles
Φ3: Few sports are good for children Φ3: Few sports are good for children
Fig 2. Sample fuzzy-syllogistic ontology with affirmative relationships and the best matching
fuzzy-syllogistic moods from the syllogistic figures 1 and 2.</p>
        <sec id="sec-6-3-1">
          <title>4.1 Reasoning Algorithm</title>
          <p>FSR is concerned with identifying for any given concept c∈C, all possible triple
concept relationships r∈R, r={M,P,S}, of the given FSO=k(C, R, A) and to reason
with the most appropriate fuzzy-syllogistic moods of its FSS k . Whereby associated
assertions a∈A may be used for exemplifying a particular reasoning.</p>
          <p>For instance, for the concept c=Bicycle, multiple triple relationships r={Bicycle,
Child, Sports} exist in the sample FSO=6(C, R, A) (Fig 2). The reasoner iterates for
the FSSs k , k=[2,n], and for their moods, in order to match the moods with the
closest fuzzy-syllogistic quantities of relationships r. The reasoner determines the FSS
k=6 and the mood 6/k1IAk2I4, 0&lt;k1,k2&lt;6 as best matches for this example.</p>
          <p>In the below example with , I in Φ3 may include A and therefore is less true.
Whereas in 3 , 3/1I in Φ3 is still too general. The best matching quantifiers are found in
6 (Fig 3).</p>
          <p>: (IAI3, 10/10=1.0)
Φ1: Some bicycles are good for children
Φ2: All bicycles are good for sports
Φ3: Some sports are good for children
3 : (3/2IA1I3, 6/6=1.0)
Φ1: Most bicycles are good for children
Φ2: All bicycles are good for sports
Φ3: Several sports are good for children
5</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>CONCLUSION</title>
      <p>The FSSs , 2 , 6 were introduced as the fundamental logic of the
fuzzysyllogistic reasoner (FSR) and its usage was exemplified on a sample
fuzzysyllogistic ontology (FSO). The relative truth ratio rτ of a mood was introduced,
which adapts the structural truth ratio τ of the mood to the amount of elements of its
syllogistic cases. FSR with FSOs is a generic possibilistic reasoning approach, since
the employed reasoning logic n is generic.</p>
      <p>We are currently implementing a sample educational application that extends an
existing probabilist ontology learning tool and generates a FSO=k(C, R, A) for a given</p>
      <sec id="sec-7-1">
        <title>Sport</title>
      </sec>
      <sec id="sec-7-2">
        <title>Child</title>
      </sec>
      <sec id="sec-7-3">
        <title>Sport</title>
      </sec>
      <sec id="sec-7-4">
        <title>Child</title>
        <p>6/4
I=most</p>
      </sec>
      <sec id="sec-7-5">
        <title>Race</title>
        <p>6/5
/16 fIe=w 6I/=1Im=anfyew
Bicycle 6/1 I=
few
6 : (6/4IA1I3, 6/6=1.0) 6 : (6/5IA1I4, 8/9=0.888)
Φ1: Most bicycles are good for children Φ1: Many children have bicycles
Φ2: All bicycles are good for sports Φ2: All bicycles are good for sports
Φ3: Few sports are good for children Φ3: Few sports are good for children
Fig 3. Sample fuzzy-syllogistic ontology with affirmative relationships and the best matching
fuzzy-syllogistic moods from the syllogistic figures 3 and 4.</p>
        <p>few
6/1 I=
Bicycle 6/1 I=
few
domain. For a user-chosen concept C from the ontology FSO, FSR is then used to
reason with all associated quantities R and present the user all associated scenarios A.
6</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Bobillo</surname>
            ,
            <given-names>F</given-names>
          </string-name>
          ; Straccia,
          <string-name>
            <surname>U;</surname>
          </string-name>
          <year>2008</year>
          ;
          <article-title>"fuzzyDL: an expressive fuzzy description logic reasoner"; Fuzzy Systems (FUZZ-IEEE);</article-title>
          IEEE Computer Society
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Bobillo</surname>
            ,
            <given-names>F</given-names>
          </string-name>
          ; Delgado,
          <string-name>
            <given-names>M;</given-names>
            <surname>Gomez-Romero</surname>
          </string-name>
          ,
          <string-name>
            <surname>J;</surname>
          </string-name>
          <year>2008</year>
          ;
          <article-title>"DeLorean: a reasoner for fuzzy OWL 1.1"; Uncertainty Reasoning for the Semantic Web</article-title>
          (URSW); Springer LNAI
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Bobillo</surname>
            ,
            <given-names>F</given-names>
          </string-name>
          ; Straccia,
          <string-name>
            <surname>U;</surname>
          </string-name>
          <year>2011</year>
          ;
          <article-title>"Reasoning with the finitely many-valued Łukasiewicz fuzzy Description Logic SROIQ"</article-title>
          ;
          <source>Information Sciences, 181</source>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Cimiano</surname>
            ,
            <given-names>P</given-names>
          </string-name>
          ; Völker,
          <string-name>
            <surname>J;</surname>
          </string-name>
          <year>2005</year>
          ;
          <article-title>"Text2Onto: A Framework for Ontology Learning</article-title>
          and
          <source>Datadriven Change Discovery"; International conference on Natural Language Processing and Information Systems</source>
          (NLDB); Springer
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Goertzel</surname>
            ,
            <given-names>B</given-names>
          </string-name>
          ; Iklé,
          <string-name>
            <surname>M</surname>
          </string-name>
          ; Goertzel,
          <string-name>
            <surname>ILF</surname>
          </string-name>
          ; Heljakka,
          <string-name>
            <surname>A;</surname>
          </string-name>
          <year>2008</year>
          ;
          <article-title>"Probabilistic Logic Networks: A Comprehensive Conceptual, Mathematical and Computational Framework for Uncertain Inference"; Springer</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Kumova</surname>
            ,
            <given-names>Bİ</given-names>
          </string-name>
          ; Çakır,
          <string-name>
            <surname>H;</surname>
          </string-name>
          <year>2010</year>
          ;
          <article-title>"The Fuzzy Syllogistic System"</article-title>
          ;
          <source>Mexican International Conference on Artificial Intelligence (MICAI); LNAI; Springer</source>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Kumova</surname>
            ,
            <given-names>Bİ</given-names>
          </string-name>
          ; Çakır,
          <string-name>
            <surname>H;</surname>
          </string-name>
          <year>2010</year>
          ;
          <article-title>"Algorithmic Decision of Syllogisms"</article-title>
          ; International Conference on Industrial,
          <source>Engineering &amp; Other Applications of Applied Intelligent Systems (IEA-AIE); Córdoba; LNCS; Springer</source>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Kumova</surname>
            ,
            <given-names>Bİ</given-names>
          </string-name>
          ;
          <year>2015</year>
          ;
          <article-title>"Generating Ontologies from Relational Data with Fuzzy-Syllogistic Reasoning"; Beyond Databases, Architectures and Structures (BDAS</article-title>
          ); Springer, Communications in Computer and Information Science (CCIS)
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Kumova</surname>
            ,
            <given-names>Bİ</given-names>
          </string-name>
          ;
          <year>2015</year>
          ;
          <article-title>"Properties of the Syllogistic System"; in review</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Łukasiewicz</surname>
            ,
            <given-names>J;</given-names>
          </string-name>
          <year>1920</year>
          ;
          <article-title>"O logice trójwartościowej" (translation from Polish: On threevalued logic); Ruch filozoficzny</article-title>
          , vol
          <volume>5</volume>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Lukasiewicz</surname>
            ,
            <given-names>T</given-names>
          </string-name>
          ; Straccia,
          <string-name>
            <surname>U;</surname>
          </string-name>
          <year>2008</year>
          ;
          <article-title>"Managing uncertainty and vagueness in description logics for the SemanticWeb"</article-title>
          ; Web Semantics: Science, Services, Agents on WWW; Elsevier
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Motik</surname>
          </string-name>
          ,   B;   Shearer,   R;   Horrocks,   I;  
          <year>2009</year>
          ;  
          <article-title>"Hypertableau   Reasoning   for   Description Logics"; </article-title>
          <source>Journal of Artificial Intelligence Research</source>
          , 
          <volume>36</volume>
          ; AAAI
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Pereira-Fariña</surname>
          </string-name>
          , M; Vidal, JC;
          <string-name>
            <surname>Díaz-Hermida</surname>
            ,
            <given-names>F</given-names>
          </string-name>
          ; Bugarín,
          <string-name>
            <surname>A;</surname>
          </string-name>
          <year>2014</year>
          ;
          <article-title>"A fuzzy syllogistic reasoning schema for generalized quantifiers"; Fuzzy Sets and Systems</article-title>
          , vol
          <volume>234</volume>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Peterson</surname>
            ,
            <given-names>P</given-names>
          </string-name>
          ;
          <year>2000</year>
          ;
          <article-title>"Intermediate Quantifiers: Logic, Linguistics, and Aristotelian Semantics"</article-title>
          ; Ashgate
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Qi</surname>
            ,
            <given-names>G</given-names>
          </string-name>
          ; Pan,
          <string-name>
            <surname>JZ</surname>
          </string-name>
          ; Ji,
          <string-name>
            <surname>Q;</surname>
          </string-name>
          <year>2007</year>
          ;
          <article-title>"A possibilistic extension of description logics"; Description Logics (DL); Sun SITE Central Europe (CEUR)</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>P</given-names>
          </string-name>
          ;
          <year>1994</year>
          ;
          <article-title>"From Inheritance Relation to Non-Axiomatic Logic"</article-title>
          ;
          <source>International Journal of Approximate Reasoning</source>
          , vol 7
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>P</given-names>
          </string-name>
          ;
          <year>1995</year>
          ;
          <article-title>"Reference Classes and Multiple Inheritances"</article-title>
          ;
          <source>International Journal of Uncertainty, Fuzziness and Knowledge-based Systems</source>
          , vol
          <volume>3</volume>
          /
          <fpage>1</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18] Yaguinuma, CA; Magalhães Jr, WCP; Santos,
          <string-name>
            <surname>MTP</surname>
          </string-name>
          ; Camargo,
          <string-name>
            <surname>HA</surname>
          </string-name>
          ; Reformat,
          <string-name>
            <surname>M;</surname>
          </string-name>
          <year>2014</year>
          ;
          <article-title>"Combining Fuzzy Ontology Reasoning and Mamdani Fuzzy Inference System with HyFOM Reasoner"</article-title>
          ; Enterprise Information Systems; LNBI, 
          <volume>190</volume>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Zadeh</surname>
            ,
            <given-names>LA</given-names>
          </string-name>
          ;
          <year>1975</year>
          ;
          <article-title>"Fuzzy Logic and Approximate Reasoning"; Syntheses 30</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Zadeh</surname>
            ,
            <given-names>LA</given-names>
          </string-name>
          ;
          <year>1985</year>
          ;
          <article-title>"Syllogistic reasoning in fuzzy logic and its application to usuality and reasoning with dispositions"</article-title>
          ;
          <source>IEEE Transactions on Systems, Man and Cybernetics</source>
          ,
          <volume>15</volume>
          /6
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Zarechnev</surname>
            ,
            <given-names>M</given-names>
          </string-name>
          ; Kumova,
          <string-name>
            <surname>Bİ</surname>
          </string-name>
          ;
          <year>2015</year>
          ;
          <article-title>"Ontology-Based Fuzzy-Syllogistic Reasoning"; Industrial, Engineering &amp; Applications of Applied Intelligent Systems (IEA-AIE); LNCS</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Zarechnev</surname>
            ,
            <given-names>M</given-names>
          </string-name>
          ; Kumova,
          <string-name>
            <surname>Bİ</surname>
          </string-name>
          ;
          <year>2015</year>
          ;
          <article-title>"Truth Ratios of Syllogistic Moods"</article-title>
          ;
          <source>IEEE International Conference on Fuzzy Systems (FUZZ-IEEE); IEEE Xplore</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>