What's New in Teams Calling, Meetings and Devices March 2024
Thesis Defense Exam Presentation
1. Thesis Defense Exam Presentation
Development of Fuzzy Syllogistic Algorithms and
Applications Distributed Reasoning Approaches
Hüseyin Çakır
Izmir Institude of Technology
huseyincakir@iyte.edu.tr
3. Introduction
●
A syllogism is a logical argument in which
conclusion can be inferred from two other
premises.
Example:
ALL PRIMATES ARE MAMMALS <<major premiss>>
ALL HUMANS ARE PRIMATES <<minor premiss>>
--------------------------------------------ALL HUMANS ARE MAMMALS <<conclusion>>
15/12/10
3
4. Introduction
●
The aim of the thesis was to:
●
Use syllogisms as reasoning mechanism.
●
Analyze the structural properties of syllogisms.
●
●
●
15/12/10
Introduce the fuzzy syllogisms, which helps giving
possibilistic values to syllogistic propositions.
Verify the truth of the approach with applications.
Discuss the possibble application areas and
drawbacks of syllogistic reasoning.
4
5. Introduction
●
●
Computational logic can be used to model
syllogistic reasoning, originally developed by
Aristotle some 2.300 years ago.
By modelling syllogisms, it is possibble to
analyze the stuctural properties of syllogisms
and syllogistic search space.
15/12/10
5
6. Research Approach
●
Aim of the thesis
●
Literature survey
●
Development
●
Application
●
Conclusion
15/12/10
6
7. Background/ Syllogism
●
●
The origin of the logic studies known goes
among ancient Babylonian, Greeks, Indian,
Chiese and Islamic cultures.
Aristotle's theory suggests that in some cases
the answer (conclusion) is predictable based on
earlier answers which called premisses.
Example:
ALL PRIMATES ARE MAMMALS <<major premiss>>
ALL HUMANS ARE PRIMATES <<minor premiss>>
--------------------------------------------ALL HUMANS ARE MAMMALS <<conclusion>>
15/12/10
7
8. Background/ Syllogism
●
Depending on alternative placements of the
objects within the premises, 4 basic types of
syllogistic figures are possible.
Figure Name
I
II
III
IV
Major Premise
Minor Premise
――――――
Conclusion
MP
SM
――
SP
PM
SM
――
SP
MP
MS
――
SP
PM
MS
――
SP
Example: Figure 1 MAMMALS: MAJOR HUMANS: MINOR PRIMATES: MIDDLE
ALL PRIMATES ARE MAMMALS
ALL M ARE P
ALL HUMANS ARE PRIMATES
ALL S ARE M
----------------------------------------------------------------------------------------ALL HUMANS ARE MAMMALS
ALL S ARE P
15/12/10
8
9. Background/ Syllogism
●
Propositions has a number of dualistic
attributes that characterize the propositions.
Name
Universality
Positivity
A
Universal
positive
E
Universal
negative
I
Particular
positive
O
Particular
negative
Example: Figure 1 - AAA
ALL PRIMATES ARE MAMMALS
ALL HUMANS ARE PRIMATES
--------------------------------------------ALL HUMANS ARE MAMMALS
15/12/10
ALL M ARE P
ALL S ARE M
--------------------------------------------ALL S ARE P
9
10. Background/ Syllogism
●
The letters A, E, I, O have been used since the
medieval schools and to memorise valid moods
mnemonic names used as follows:
Figure 1
Figure 2
Figure 3
Figure 4
Barbara (AAA)
Cesare (EAE)
Datisi (AII)
Calemes (AEE)
Celarent (EAE)
Camestres
(AEE)
Disamis (IAI)
Dimatis (IAI)
Darii (AII)
Festino (EIO)
Ferison (EIO)
Fresison (EIO)
Ferio (EIO)
Baroco (AOO)
Bocardo (OAO)
Calemos (AEO)
Barbari (AAI)
Cesaro (EAO)
Felapton (EAO)
Fesapo (EAO)
Celaront (EAO)
Camestros
(AEO)
Darapti (AAI)
Bamalip (AAI)
15/12/10
10
11. Background/ Syllogism
●
●
Aristotle had specified the first three figures.
The 4th figure was discovered in the middle
age.
The first proposition consist of a quantified
relationship between the objects M and P, the
second proposition of S and M, the conclusion
of S and P.
Figure Name
II
III
IV
Major Premise
Minor Premise
――――――
Conclusion
15/12/10
I
MP
SM
――
SP
PM
SM
――
SP
MP
MS
――
SP
PM
MS
――
SP
11
13. Background/ Syllogism
●
Since the proposition operator may have 4
values, 64 syllogistic moods are possible for
every figure and 256 moods for all 4 figures in
total.
FIGURE I
FIGURE III
FIGURE IV
AAA -1
AAO -1
AAE - 1
AAI - 1
...
15/12/10
FIGURE II
AAA - 2
AAO - 2
AAE - 2
AAI - 2
...
AAA - 3
AAO - 3
AAE - 3
AAI - 3
...
AAA - 4
AAO - 4
AAE - 4
AAI - 4
...
13
14. Background/ Syllogism
●
Invalid syllogisms are also one of the most
important issue of syllogisms.
●
Affirmative conclusion from a negative premise.
–
●
Existential fallacy.
–
●
Conclusion I or O while premiss is E or A.[Ex: AAI]
Fallacy of exclusive premises.
–
15/12/10
Conclusion A or I while premiss is E or O.[Ex: AEA]
Two negative premisses. [Ex: EEA]
14
15. Background/ Syllogism
●
Fallacy of the undistributed middle.
–
●
Illicit major/minor.
–
●
Middle term must be distributed in at least one premiss.
No term can be distributed in conclusion which is not
distributed in premiss.
Fallacy of necessity.
–
Exactly three terms, used in same sense.
Statement
Subject P
ALL M ARE P (A)
Disributed
Undistributed
ALL M ARE NOT P (E)
Distributed
Distributed
SOME M ARE P (I)
15/12/10
Subject M
Undistributed
Undistributed
SOME M ARE NOT P
(O)
Undistributed
Distributed
15
16. Background/ Reasoning
●
The syllogism is part of deductive reasoning,
where facts are determined by combining
existing statements, in contrast to inductive
reasoning.
15/12/10
16
17. Background/ Formal Representation
●
Formal representation of syllogisms can be
made by using several approaches:
●
Euler Diagram Representation
●
Venn Diagram Representation
●
Linear Representation
●
...
15/12/10
17
18. Background/ Formal Representation
●
The terms in a proposition are related to each
other in four different ways. (Set-Theoretic App.)
Operator
Proposition
A
All S are P
E
All S are not P
I
Some S are P
O
Some S are not P
15/12/10
Set-Theoretic Representation of Logical Cases
18
19. Background/ Fuzzy Logic
●
●
Fuzzy logic is reasoning that is approximate
rather than accurate. (opposite of crisp logic)
Fuzzy logic variables can have a truth value
that ranges between 0 and 1.
Possibility
Probability
15/12/10
19
21. Structural Analysis of Syllogisms
●
●
For three symmetrically intersecting sets there
are in total 11 possible sub-sets in a Venn
diagram.
If symmetric set relationships are relaxed and
the three sets are named, for instance with the
syllogistic terms P, M and S, then 41 set
relationships are possible.
15/12/10
21
22. Structural Analysis of Syllogisms
Example:
11
distinct set
situations
...
...
15/12/10
41
Set
relationships
22
26. Structural Analysis of Syllogisms
Example: Figure 1 - AAA
ALL PRIMATES ARE MAMMALS
ALL HUMANS ARE PRIMATES
--------------------------------------------ALL HUMANS ARE MAMMALS
ALL M ARE P
ALL S ARE M
--------------------------------------------ALL S ARE P
Sub-Set Number 1
2
3
4
5
6
7
8
9
Arithmetic
Relation
a+e
a+c
a+b
f+b
f+e
g+c
g+e
d+b
d+c
Syllogistic Case
P∩M M∩S S∩P
P-M
P-S
M-P
M-S
S-M
S-P
0
0
0
15/12/10
26
28. Structural Analysis of Syllogisms
●
The above homomorphism represents the
essential data structure of the algorithm for
deciding syllogistic moods.
Arithmetic
Relation
a+e
a+c
a+b
f+b
f+e
g+c
g+e
d+b
d+c
#1
1
1
1
1
1
0
1
0
0
...
...
...
...
...
...
...
...
...
#2
...
#41
15/12/10
28
29. Structural Analysis of Syllogisms
●
The pseudo code of the algorithm for
determining the true and false cases of a given
moods is based on selecting the possible set
relationships for that mood, out of all 41
possible set relationships.
15/12/10
29
30. Structural Analysis of Syllogisms
Pseudocode:
DETERMINE mood
READ figure number {1,2,3,4}
READ with 3 proposition ids {A,E,I,O}
GENERATE 41 possible set combinations with 9 relationships into an array
SetCombi[41,9]={{1,1,1,1,1,1,1,1,1}, ..., {0,1,0,0,1,1,1,1,1}}
VALIDATE every proposition with either validateAllAre,
validateAllAreNot, validateSomeAreNot or validateSomeAre
DISPLAY valid and invalid cases of the mood
VALIDATE mood
validateAllAre(x,y) //all M are P
if(x=='M' && y=='P')
CHECK the sets suitable for this mood in setCombi
if 1=1 and 2=0 then add this situation as valid
if(setCombi[i][0]==1 && setCombi[i][1]==0)
//similar for validateAllAreNot(), validateSomeAre(),validateSomeAreNot()
15/12/10
30
31. DETERMINE MOOD
Structural Analysis of Syllogisms
FIGURE 1,2,3,4
PROPOSITION A,E,I,O
GENERATE 41 POSSIBLE SET COMBINATIONS
SET RELATIONSHIPS INTO ARRAY
VALIDATE EVERY PROPOSITION
15/12/10
31
32. Structural Analysis of Syllogisms
●
●
Statistics gained from the algorithm mentioned
in previous section.
This algorithm provides some beneficial
statistics about syllogisms which enables
understanding the structural behaviours of
syllogisms.
15/12/10
32
33. Structural Analysis of Syllogisms
●
●
According to the model there exists 11 distinct
relations among Venn Diagrams that provide
determining syllogisms.
Every mood has 0 to 21 true and 0 to 21 false
cases, which is a real subset of the 41 distinct
cases.
15/12/10
33
34. Structural Analysis of Syllogisms
●
●
For any given figure the total number of all true
cases is equal to all false cases, ie 328 true and
328 false cases.
For all 4 syllogistic figures the total number of 4
x 2 x 328 = 2624 cases.
15/12/10
34
35. Structural Analysis of Syllogisms
MOOD
# of valids
# of invalids
valid cases
------------------------------------------------------------------mood[2]:
|
0
|
1
|
mood[4]:
|
0
|
1
|
mood[10]:
|
0
|
6
|
mood[17]:
|
0
|
1
|
mood[19]:
|
0
|
1
|
mood[25]:
|
0
|
7
|
mood[1]:
|
1
|
0
|-25mood[3]:
|
1
|
0
|-25mood[5]:
|
1
|
2
|-29mood[6]:
|
1
|
2
|-21mood[14]:
|
1
|
7
|-21mood[49]:
|
2
|
6
|-5—10…
------------------------------------------------------------------TOTAL NUMBER OF VALID SUBSETS FOR THIS FIGURE:328
TOTAL NUMBER OF INVALID SUBSETS FOR THIS FIGURE:328
TOTAL NUMBER OF SUBSETS FOR THIS FIGURE:656
-------------------------------------------------------------------
15/12/10
35
37. Structural Analysis of Syllogisms
●
Reducing fallacies:
Rule 1, “convert E into O since the information in O
also contains the information in E”.
Rule 2 , “convert A into I since the information in A
also contains the information in I”.
15/12/10
37
42. Structural Analysis of Syllogisms
●
Fuzzy Syllogisms:
●
●
The results discussed above used same approach
as in Aristotle 's, so it decides on syllogisms as valid
or invalid which gives strict decisions on syllogisms
either name them as true or false.
But our objective is to utilize the full set of all
256 moods as a fuzzy syllogistic system of
possibilistic arguments.
15/12/10
42
43. Structural Analysis of Syllogism
●
The truth values for every mood in form of a
truth ration between its true and false cases, so
that the truth ratio becomes a real number,
normalized within [0, 1].
15/12/10
43
51. Applications for Syllogistic
Reasoning
●
During this study various applications
developed to check validty of algorithm.
●
●
●
15/12/10
Mathematical applications to check validity of
algorithm and to reveal statistics about syllogism.
Application that use syllogistic reasoning in
distributed way.
Use of syllogistic reasoning in object-oriented
programming.
51
57. Conclusion
●
●
Mathematical properties of the whole syllogistic
system are revealed in detail including
applications and statistics.
It is believed that this thesis has two
contributions to the literature, specifically to the
search space of syllogisms and to the
fuzzification of syllogistic values.
15/12/10
57
58. Conclusion
●
●
The principles that have been developed in this
thesis work can be used as a reference in
developing some applications about syllogistic
reasoning.
The reason why it contributes to syllogistic
reasoning field is that it shows the whole validity
values for all moods in all figures.
15/12/10
58
59. Conclusion
●
●
A computer software, that provides the
necessary aid to the programmer as software
editor can also be developed as a future work.
This will enable the syllogistic reasoning used in
applications which will make remarkable
contribution to syllogistic reasoning approach.
15/12/10
59