2026-04-14T06:25:16Zhttps://recercat.cat/oai/request

oai:recercat.cat:10459.1/579842024-12-05T21:28:45Zcom_2072_3622col_2072_479130

2024-12-05T21:28:45Z urn:hdl:10459.1/57984 Two formalisms of extended possibilistic logic programming with context-dependent fuzzy unification: A comparative description Alsinet, Teresa Godó, Lluís Sandri, Sandra 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. 2024-12-05T21:28:45Z 2024-12-05T21:28:45Z 2016-10-19T10:55:02Z 2016-10-19T10:55:02Z 2002 article publishedVersion http://hdl.handle.net/10459.1/57984 Reproducció del document publicat a https://doi.org/10.1016/S1571-0661(04)80511-5 Electronic Notes in Theoretical Computer Science, 2002, vol. 66, núm. 5, p. 1-21 cc-by-nc-nd (c) Elsevier, 2002 info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-nd/3.0/es/ Elsevier