Two formalisms of extended possibilistic logic programming with context-dependent fuzzy unification
Teresa Alsinet, Lluı́s Godo, Sandra Aparecida Sandri · Electronic Notes in Theoretical Computer Science · 2002
Possibilistic logic is a logic of uncertainty where a certainty degree between 0 and 1, interpreted as a lower bound of a necessity measure, is attached to each classical formula. In this paper we present a comparative description of two models extending first order possibilistic logic so as to allow for fuzzy unification. The first formalism, called PLFC, is a general extension that allows clauses with fuzzy constants and fuzzily restricted quantifiers. The second formalism is an implication-based extension defined on top of Gödel infinitely-valued logic, capable of dealing with fuzzy constants. In this paper we compare these approaches, mainly their Horn-clause fragments, discussing their basic differences, specially in what regards their unification and automated deduction mechanisms.