A Fuzzy Syllogistic Reasoning Schema for Generalized Quantifiers
M. Pereira-Fari\~na, Juan C. Vidal, F. D\'iaz-Hermida, A. Bugar\'in

TL;DR
This paper introduces a new fuzzy syllogistic reasoning schema that handles various types of generalized quantifiers and multiple premises by formulating the reasoning process as a mathematical optimization problem.
Contribution
It extends existing approaches by incorporating diverse quantifier types and premises, providing a systematic optimization-based reasoning procedure.
Findings
Effective handling of different quantifier types
Ability to process multiple premises simultaneously
Reasoning formulated as an optimization problem
Abstract
In this paper, a new approximate syllogistic reasoning schema is described that expands some of the approaches expounded in the literature into two ways: (i) a number of different types of quantifiers (logical, absolute, proportional, comparative and exception) taken from Theory of Generalized Quantifiers and similarity quantifiers, taken from statistics, are considered and (ii) any number of premises can be taken into account within the reasoning process. Furthermore, a systematic reasoning procedure to solve the syllogism is also proposed, interpreting it as an equivalent mathematical optimization problem, where the premises constitute the constraints of the searching space for the quantifier in the conclusion.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
