Reasoning with belief functions over Belnap–Dunn logic

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F24%3A00582922" target="_blank" >RIV/67985807:_____/24:00582922 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.apal.2023.103338" target="_blank" >https://doi.org/10.1016/j.apal.2023.103338</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.apal.2023.103338" target="_blank" >10.1016/j.apal.2023.103338</a>

Result language
angličtina
Original language name
Reasoning with belief functions over Belnap–Dunn logic
Original language description
We design an expansion of Belnap–Dunn logic with belief and plausibility functions that allows non-trivial reasoning with contradictory and incomplete probabilistic information. We also formalise reasoning with non-standard probabilities and belief functions in two ways. First, using a calculus of linear inequalities, akin to the one presented in [23]. Second, as a two-layered modal logic wherein reasoning with evidence (the outer layer) utilises paraconsistent expansions of Łukasiewicz logic. The second approach is inspired by [3]. We prove completeness for both kinds of calculi and show their equivalence by establishing faithful translations in both directions.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA22-01137S" target="_blank" >GA22-01137S: Metamathematics of substructural modal logics</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)