dc.contributor.author |
Alsinet, Teresa |
dc.contributor.author |
Godo i Lacasa, Lluís |
dc.date |
2013-09-09T12:32:12Z |
dc.date |
2013-09-09T12:32:12Z |
dc.date |
2004 |
dc.identifier |
0165-0114 |
dc.identifier |
http://hdl.handle.net/10459.1/46632 |
dc.identifier |
https://doi.org/10.1016/j.fss.2003.10.013 |
dc.identifier.uri |
http://hdl.handle.net/10459.1/46632 |
dc.description |
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. |
dc.language |
eng |
dc.publisher |
Elsevier |
dc.relation |
Versió postprint del document publicat a: https://doi.org/10.1016/j.fss.2003.10.013 |
dc.relation |
Fuzzy Sets and Systems, 2004, vol. 144, núm. 1, pàg. 43–65 |
dc.rights |
(c) Elsevier, 2004 |
dc.rights |
info:eu-repo/semantics/openAccess |
dc.subject |
Possibilistic logic |
dc.subject |
Fuzzy constants |
dc.subject |
Horn-rule sublogic |
dc.subject |
Similarity-based unification |
dc.subject |
Programació lògica |
dc.subject |
Lògica probabilística |
dc.title |
Adding similarity-based reasoning capabilities to a Horn fragment of possibilistic logic with fuzzy constants |
dc.type |
article |
dc.type |
acceptedVersion |