| bibtype |
J -
Journal Article
|
| ARLID |
0531644 |
| utime |
20240103224328.6 |
| mtime |
20200818235959.9 |
| SCOPUS |
85067814416 |
| WOS |
000488995000016 |
| DOI |
10.1016/j.inffus.2019.06.018 |
| title
(primary) (eng) |
The axiomatization of asymmetric disjunction and conjunction |
| specification |
| page_count |
9 s. |
| media_type |
P |
|
| serial |
| ARLID |
cav_un_epca*0316476 |
| ISSN |
1566-2535 |
| title
|
Information Fusion |
| volume_id |
53 |
| volume |
1 (2020) |
| page_num |
165-173 |
| publisher |
|
|
| keyword |
And if possible operators |
| keyword |
Averaging functions |
| keyword |
Or else operators |
| author
(primary) |
| ARLID |
cav_un_auth*0394828 |
| name1 |
Hudec |
| name2 |
M. |
| country |
SK |
| share |
50 |
| garant |
K |
|
| author
|
| ARLID |
cav_un_auth*0101163 |
| name1 |
Mesiar |
| name2 |
Radko |
| institution |
UTIA-B |
| full_dept (cz) |
Ekonometrie |
| full_dept |
Department of Econometrics |
| department (cz) |
E |
| department |
E |
| full_dept |
Department of Econometrics |
| share |
50 |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| source |
|
| source |
|
| cas_special |
| abstract
(eng) |
In many real-world cases, disjunction is expressed as the fusion of full alternatives and less relevant ones, which leads to an OR ELSE connective. Obviously, this connective, so-called intensified disjunction, should provide a solution lower than or equal to the MAX operator, and higher than or equal to the projection of the full alternative. Further, to cover the cases when higher satisfaction degrees to the less relevant alternative cause that it becomes the full alternative, non–continuous asymmetric disjunction is required. The dual observation holds for the fusion of constraints (hard conditions) and wishes (soft conditions) expressed by an AND IF POSSIBLE connective. In order to cover these requirements, the paper focuses on developing a full axiomatization of asymmetric disjunction and asymmetric conjunction by averaging functions. Next, the necessity and sufficiency for associative behaviour have been proven. Moreover, the non-dual cases are also documented. Finally, the obtained results are illustrated on examples, and their applicability is also discussed. |
| result_subspec |
WOS |
| RIV |
BA |
| FORD0 |
10000 |
| FORD1 |
10100 |
| FORD2 |
10102 |
| reportyear |
2021 |
| num_of_auth |
2 |
| inst_support |
RVO:67985556 |
| permalink |
http://hdl.handle.net/11104/0310642 |
| confidential |
S |
| mrcbC86 |
3+4 Article Computer Science Artificial Intelligence|Computer Science Theory Methods |
| mrcbC91 |
A |
| mrcbT16-e |
COMPUTERSCIENCEARTIFICIALINTELLIGENCE|COMPUTERSCIENCETHEORYMETHODS |
| mrcbT16-i |
2.64081 |
| mrcbT16-j |
2.661 |
| mrcbT16-s |
2.776 |
| mrcbT16-B |
91.122 |
| mrcbT16-D |
Q1* |
| mrcbT16-E |
Q1* |
| arlyear |
2020 |
| mrcbU14 |
85067814416 SCOPUS |
| mrcbU24 |
PUBMED |
| mrcbU34 |
000488995000016 WOS |
| mrcbU63 |
cav_un_epca*0316476 Information Fusion 1566-2535 1872-6305 Roč. 53 č. 1 2020 165 173 Elsevier |
|