On modelling of syllogistic reasoning on computer

The aim of this thesis is to give information about how to create modules for counter-models and logical inferences of syllogistic reasonings in Natural English Language with the scope of Natural Logic Program by using Python programming language. This thesis consists of six sections. After the introduction chapter in which the general information concerning to the thesis is given, in the Preliminaries, fundamental and basic notions are presented. In Section 3, genesis, rise, classical and modern interpretations of the syllogism notion are mentioned. Also, differences and similarities between classical and modern syllogisms are given. In Section 4, logical and algebraic properties that are related to basic syllogistic logics and syllogistic logics that consist of cardinality and intersecting adjectives are given. In Section 5, we present tools which are used for implementing syllogistic logics and show inference algorithms of the logics, structures of grammatical in the natural language, data structures of the logics corresponding to computer, how to avoid infinite loop and also how much time are needed to stop programs of created modules that depend on numbers of input data. In Section 6, we final to the thesis with summary of the thesis.