inconsistent R e c e n tly, a syntactical extension of rst order Possibilistic logic (called PLFC) dealing with fuzzy constants and fuzzily restricted quanti ers has been proposed. In this paper we present steps towards both the formalization of PLFC itself and an automated deduction system for it by (i) providing a formal semantics (ii) de ning a sound resolution-style calculus by refutation and (iii) describing a rst-order proof procedure for PLFC clauses based on (ii) and on a novel notion of most general substitution of two literals in a resolution step.
Alsinet, et al. REF provide PLFC with a formal semantics and a sound resolution-style calculus.
On the Semantics and Automated Deduction for PLFC, a Logic of Possibilistic Uncertainty and Fuzziness
ArXiv
ArXiv
Computer Science