| bibtype |
J -
Journal Article
|
| ARLID |
0471671 |
| utime |
20240103213702.5 |
| mtime |
20170228235959.9 |
| SCOPUS |
85014645540 |
| WOS |
000397037900006 |
| DOI |
10.1093/logcom/exv081 |
| title
(primary) (eng) |
Modal extensions of Lukasiewicz logic for modelling coalitional power |
| specification |
| page_count |
26 s. |
| media_type |
P |
|
| serial |
| ARLID |
cav_un_epca*0253859 |
| ISSN |
0955-792X |
| title
|
Journal of Logic and Computation |
| volume_id |
27 |
| volume |
1 (2017) |
| page_num |
129-154 |
|
| keyword |
Coalition Logic |
| keyword |
Lukasiewicz modal logic |
| keyword |
effectivity function |
| author
(primary) |
| ARLID |
cav_un_auth*0101141 |
| full_dept (cz) |
Matematická teorie rozhodování |
| full_dept (eng) |
Department of Decision Making Theory |
| department (cz) |
MTR |
| department (eng) |
MTR |
| full_dept |
Department of Decision Making Theory |
| share |
50 |
| name1 |
Kroupa |
| name2 |
Tomáš |
| institution |
UTIA-B |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| author
|
| ARLID |
cav_un_auth*0306052 |
| share |
50 |
| name1 |
Teheux |
| name2 |
B. |
| country |
LU |
|
| source |
|
| cas_special |
| project |
| ARLID |
cav_un_auth*0284931 |
| project_id |
GAP402/12/1309 |
| agency |
GA ČR |
|
| abstract
(eng) |
Modal logics for reasoning about the power of coalitions capture the notion of effectivity functions associated with game forms. The main goal of coalition logics is to provide formal tools for modelling the dynamics of a game frame whose states may correspond to different game forms. The two classes of effectivity functions studied are the families of playable and truly playable effectivity functions, respectively. In this article, we generalize the concept of effectivity function beyond the yes/no truth scale. This enables us to describe the situations in which the coalitions assess their effectivity in degrees, based on functions over the outcomes taking values in a finite Lukasiewicz chain. Then we introduce two modal extensions of Lukasiewicz finite-valued logic together with many-valued neighbourhood semantics in order to encode the properties of many-valued effectivity functions associated with game forms. As our main results we prove completeness theorems for the two newly introduced modal logics. |
| RIV |
BA |
| FORD0 |
10000 |
| FORD1 |
10100 |
| FORD2 |
10101 |
| reportyear |
2018 |
| num_of_auth |
2 |
| inst_support |
RVO:67985556 |
| permalink |
http://hdl.handle.net/11104/0271352 |
| confidential |
S |
| mrcbC86 |
3+4 Article Computer Science Theory Methods|Logic |
| mrcbC86 |
3+4 Article Computer Science Theory Methods|Logic |
| mrcbC86 |
3+4 Article Computer Science Theory Methods|Logic |
| mrcbT16-e |
COMPUTERSCIENCETHEORYMETHODS|LOGIC |
| mrcbT16-j |
0.436 |
| mrcbT16-s |
0.381 |
| mrcbT16-B |
44.937 |
| mrcbT16-D |
Q3 |
| mrcbT16-E |
Q3 |
| arlyear |
2017 |
| mrcbU14 |
85014645540 SCOPUS |
| mrcbU24 |
PUBMED |
| mrcbU34 |
000397037900006 WOS |
| mrcbU63 |
cav_un_epca*0253859 Journal of Logic and Computation 0955-792X 1465-363X Roč. 27 č. 1 2017 129 154 |
|