Title :
On the semantics for qualified syllogisms
Author :
Schwartz, Daniel G.
Author_Institution :
Dept. of Comput. Sci., Florida State Univ., Tallahassee, FL, USA
Abstract :
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 Σ-counts (restricted to crisp predicates). These are compared as to their mathematical interrelationship and their prospective applications
Keywords :
Bayes methods; fuzzy logic; fuzzy set theory; inference mechanisms; probabilistic logic; semantic networks; uncertainty handling; Aristotelean syllogism; Bayes method; fuzzy logic; fuzzy probability; fuzzy quantifiers; fuzzy reasoning; likelihood modifiers; qualified syllogisms; semantics; usuality modifiers; Bayesian methods; Birds; Cats; Computer science; Fuzzy logic; Out of order; Tail;
Conference_Titel :
Fuzzy Systems, 1996., Proceedings of the Fifth IEEE International Conference on
Conference_Location :
New Orleans, LA
Print_ISBN :
0-7803-3645-3
DOI :
10.1109/FUZZY.1996.552305
