On the semantics for qualified syllogisms

Daniel G. Schwartz · Proceedings of IEEE 5th International Fuzzy Systems · 2002

A qualified syllogism is a classical Aristotelean syllogism that has been 'qualified' through the use of fuzzy quantifiers, likelihood modifiers, and usuality modifiers. This paper presents a formal logic Q, consisting of a language suitable for expressing such syllogisms, together with two distinct semantics which validate them. Both semantics are probabilistic-one is Bayesian and one is based on Zadeh's semantics of /spl Sigma/-counts (restricted to crisp predicates). These are compared as to their mathematical interrelationship and their prospective applications.

Read the paper · More papers on PaperTik