Thesis Presentation: «Approximate Syllogistic Reasoning: A Contribution to Inference Patterns and Use Cases»

In this research, we deal with syllogistic reasoning, a kind of deductive inference based on the chaining of terms through quantified statements. Particularly, we focus on the analysis of arguments that involve fuzzy quantified statements and approximate chaining. For the management of the statements, Theory of Generalized Quantifiers is used; for the approximate chaining, synonymy is proposed and for the inference patterns, Soft Computing techniques are applied. Its application is the processing of problems involving probabilities (such us prosecutor's fallacy in legal argumentation) through syllogisms expressed in natural language, for being easier for non-especialized users.