A 4-step Inference Method for Natural Language Propositions Involving Fuzzy Quantifiers and Truth Qualifiers

In this paper, we propose a 4-step inference method needed for constructing a natural language communication system. The method is used to obtain fuzzy quantifier Q′when QA is Fisr τ⇔ Q′(m′A) is mF is m"is τ is inferred (Q, Q′: quantifiers, A: fuzzy subject, m′, m": modifiers, y: fuzzy predicate, τ: truth qualifier). We show that Q′is resolved step by step for two types of Q, including a non-increasing type (few,...) and a non-decreasing type(most,...).