Fuzzy inference systems, Non-classical logics, Automated theorem proving, Non-clausal resolution, General resolution, Unification

The article presents refutational resolution theorem proving system for the Fuzzy Predicate Logic of First-Order (FPL) based on the general (non-clausal) resolution rule. There is also presented an unification algorithm handling existentiality without skolemization. Its idea follows from the general resolution with existentiality for the first-order logic. When the prover is constructed it provides the deductive system, where existing resolution strategies may be used with some limitations arising from specific properties of the FPL.

The article presents refutational resolution theorem proving system for the Fuzzy Predicate Logic of First-Order (FPL) based on the general (non-clausal) resolution rule. There is also presented an unification algorithm handling existentiality without skolemization. Its idea follows from the general resolution with existentiality for the first-order logic. When the prover is constructed it provides the deductive system, where existing resolution strategies may be used with some limitations arising from specific properties of the FPL.