A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Two formalisms of extended possibilistic logic programming with context-dependent fuzzy unification
2002
Electronical Notes in Theoretical Computer Science
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
doi:10.1016/s1571-0661(04)80511-5
fatcat:fhk2i3qkyzcc3pqypkct7yaia4