bibtype |
J -
Journal Article
|
ARLID |
0469148 |
utime |
20240103213400.2 |
mtime |
20170116235959.9 |
SCOPUS |
84875418614 |
WOS |
000316774700023 |
DOI |
10.1016/j.ins.2012.12.010 |
title
(primary) (eng) |
A logical approach to fuzzy truth hedges |
specification |
page_count |
20 s. |
media_type |
P |
|
serial |
ARLID |
cav_un_epca*0256752 |
ISSN |
0020-0255 |
title
|
Information Sciences |
volume_id |
232 |
volume |
1 (2013) |
page_num |
366-385 |
publisher |
|
|
keyword |
Mathematical fuzzy logic |
keyword |
Standard completeness |
keyword |
Truth hedges |
author
(primary) |
ARLID |
cav_un_auth*0019168 |
name1 |
Esteva |
name2 |
F. |
country |
ES |
|
author
|
ARLID |
cav_un_auth*0015019 |
name1 |
Godo |
name2 |
L. |
country |
ES |
|
author
|
ARLID |
cav_un_auth*0293476 |
full_dept (cz) |
Matematická teorie rozhodování |
full_dept |
Department of Decision Making Theory |
department (cz) |
MTR |
department |
MTR |
full_dept |
Department of Decision Making Theory |
name1 |
Noguera |
name2 |
Carles |
institution |
UTIA-B |
garant |
K |
fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
source |
|
cas_special |
abstract
(eng) |
The starting point of this paper are the works of Hájek and Vychodil on the axiomatization of truth-stressing and -depressing hedges as expansions of Hájek's BL logic by new unary connectives. They showed that their logics are chain-complete, but standard completeness was only proved for the expansions over Gödel logic. We propose weaker axiomatizations over an arbitrary core fuzzy logic which have two main advantages: (i) they preserve the standard completeness properties of the original logic and (ii) any subdiagonal (resp. superdiagonal) non-decreasing function on [0,1] preserving 0 and 1 is a sound interpretation of the truth-stresser (resp. depresser) connectives. Hence, these logics accommodate most of the truth hedge functions used in the literature about of fuzzy logic in a broader sense. |
RIV |
BA |
reportyear |
2017 |
inst_support |
RVO:67985556 |
permalink |
http://hdl.handle.net/11104/0269419 |
confidential |
S |
mrcbT16-e |
COMPUTERSCIENCEINFORMATIONSYSTEMS |
mrcbT16-f |
3.969 |
mrcbT16-g |
0.640 |
mrcbT16-h |
4.IX |
mrcbT16-i |
0.02647 |
mrcbT16-j |
0.889 |
mrcbT16-k |
12028 |
mrcbT16-l |
602 |
mrcbT16-s |
2.171 |
mrcbT16-z |
ScienceCitationIndex |
mrcbT16-4 |
Q1 |
mrcbT16-B |
75.425 |
mrcbT16-C |
94.444 |
mrcbT16-D |
Q1 |
mrcbT16-E |
Q1 |
arlyear |
2013 |
mrcbU14 |
84875418614 SCOPUS |
mrcbU24 |
PUBMED |
mrcbU34 |
000316774700023 WOS |
mrcbU63 |
cav_un_epca*0256752 Information Sciences 0020-0255 1872-6291 Roč. 232 č. 1 2013 366 385 Elsevier |
|