Semantics and computation of the generalized modus ponens: the long paper

摘要: Abstract The generalized modus ponens is a fuzzy logic pattern of reasoning that permits inferences to be made with rules having imprecise information in both their antecedent and consequent parts. Several alternatives are available represent the meaning one wishes assign given rule. This paper first explores four most often encountered possibilities, case where single rule considered at time. Second, behavior two them (which seem sufficient for practical use deduction systems) investigated situation dependency between variables described by collection rather than Conjectures about what semantically important result yielded exact computation ponens. With these hypothesis it shown can get meaningful approximation produced technique also avoid well-known inefficiency problem associated its computation.