Adding similarity-based reasoning capabilities to a Horn fragment of possibilistic logic with fuzzy constants
MetadataShow full item record
PLFC is a first-order possibilistic logic dealing with fuzzy constants and fuzzily restricted quantifiers. The refutation proof method in PLFC is mainly based on a generalized resolution rule which allows an implicit graded unification among fuzzy constants. However, unification for precise object constants is classical. In order to use PLFC for similarity-based reasoning, in this paper we extend a Horn-rule sublogic of PLFC with similarity-based unification of object constants. The Horn-rule sublogic of PLFC we consider deals only with disjunctive fuzzy constants and it is equipped with a simple and efficient version of PLFC proof method. At the semantic level, it is extended by equipping each sort with a fuzzy similarity relation, and at the syntactic level, by fuzzily “enlarging” each non-fuzzy object constant in the antecedent of a Horn-rule by means of a fuzzy similarity relation.
Is part ofFuzzy Sets and Systems, 2004, vol. 144, núm. 1, pàg. 43–65
European research projects
Showing items related by title, author, creator and subject.
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification Alsinet, Teresa; Chesñevar, Carlos Iván; Godo i Lacasa, Lluís; Sandri, Sandra; Simari, Guillermo Ricardo (Elsevier, 2008)Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the ...
A logic programming framework for possibilistic argumentation: formalization and logical properties Alsinet, Teresa; Chesñevar, Carlos Iván; Godo i Lacasa, Lluís; Simari, Guillermo Ricardo (Elsevier, 2008)In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for ...
Towards an Automated Deduction System for First-Order Possibilistic Logic Programming with Fuzzy Constants Alsinet, Teresa; Godo i Lacasa, Lluís (Wiley, 2002)In this article, we present a first-order logic programming language for fuzzy reasoning under possibilistic uncertainty and poorly known information. Formulas are represented by a pair (ϕ, α), in which ϕ is a first-order ...