Abstract
We propose a generalized inference metho for constructing natural
language communication. The method is used to obtain fuzzy quantifier
Q' when "QA are F is tau -> Q'(mA) are mF is m''tau" is inferred (Q, Q':fuzzy quantifiers, A:fuzzy subject, m,m',m":modifiers, F:fuzzy predicate, tau:truth qualifier). We show that Q' is resolved step by
step for non-increasing type(few,...) and a non-decreasing type
(most,...).