Vše

Co hledáte?

Vše
Projekty
Výsledky výzkumu
Subjekty

Rychlé hledání

  • Projekty podpořené TA ČR
  • Významné projekty
  • Projekty s nejvyšší státní podporou
  • Aktuálně běžící projekty

Chytré vyhledávání

  • Takto najdu konkrétní +slovo
  • Takto z výsledků -slovo zcela vynechám
  • “Takto můžu najít celou frázi”

Two-layered logics for probabilities and belief functions over Belnap-Dunn logic

Identifikátory výsledku

  • Kód výsledku v IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F25%3A00637267" target="_blank" >RIV/67985807:_____/25:00637267 - isvavai.cz</a>

  • Nalezeny alternativní kódy

    RIV/67985955:_____/25:00637267

  • Výsledek na webu

    <a href="https://doi.org/10.1017/S0960129525000064" target="_blank" >https://doi.org/10.1017/S0960129525000064</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1017/S0960129525000064" target="_blank" >10.1017/S0960129525000064</a>

Alternativní jazyky

  • Jazyk výsledku

    angličtina

  • Název v původním jazyce

    Two-layered logics for probabilities and belief functions over Belnap-Dunn logic

  • Popis výsledku v původním jazyce

    This paper is an extended version of Bílková et al. ((2023b). Logic, Language, Information, and Computation. WoLLIC 2023, Lecture Notes in Computer Science, vol. 13923, Cham, Springer Nature Switzerland, 101-117.). We discuss two-layered logics formalising reasoning with probabilities and belief functions that combine the Łukasiewicz [0, 1]-valued logic with Baaz Δ operator and the Belnap-Dunn logic. We consider two probabilistic logics - PrŁ2Δ (introduced by Bílková et al. 2023d. Annals of Pure and Applied Logic, 103338.) and 4PrŁΔ (from Bílková et al. 2023b. Logic, Language, Information, and Computation. WoLLIC 2023, Lecture Notes in Computer Science, vol. 13923, Cham, Springer Nature Switzerland, 101-117.) - that present two perspectives on the probabilities in the Belnap-Dunn logic. In PrŁ2Δ, every event φ has independent positive and negative measures that denote the likelihoods of φ and -φ, respectively. In 4PrŁΔ, the measures of the events are treated as partitions of the sample into four exhaustive and mutually exclusive parts corresponding to pure belief, pure disbelief, conflict and uncertainty of an agent in φ. In addition to that, we discuss two logics for the paraconsistent reasoning with belief and plausibility functions from Bílková et al. ((2023d). Annals of Pure and Applied Logic, 103338.) - BelŁ2Δ and BelNŁ. Both these logics equip events with two measures (positive and negative) with their main difference being that in BelŁ2Δ, the negative measure of φ is defined as the belief in -φ while in BelNŁ, it is treated independently as the plausibility of -φ.We provide a sound and complete Hilbert-style axiomatisation of 4PrŁΔand establish faithful translations between it and PrŁ2Δ. We also show that the validity problem in all the logics is coNP-complete.

  • Název v anglickém jazyce

    Two-layered logics for probabilities and belief functions over Belnap-Dunn logic

  • Popis výsledku anglicky

    This paper is an extended version of Bílková et al. ((2023b). Logic, Language, Information, and Computation. WoLLIC 2023, Lecture Notes in Computer Science, vol. 13923, Cham, Springer Nature Switzerland, 101-117.). We discuss two-layered logics formalising reasoning with probabilities and belief functions that combine the Łukasiewicz [0, 1]-valued logic with Baaz Δ operator and the Belnap-Dunn logic. We consider two probabilistic logics - PrŁ2Δ (introduced by Bílková et al. 2023d. Annals of Pure and Applied Logic, 103338.) and 4PrŁΔ (from Bílková et al. 2023b. Logic, Language, Information, and Computation. WoLLIC 2023, Lecture Notes in Computer Science, vol. 13923, Cham, Springer Nature Switzerland, 101-117.) - that present two perspectives on the probabilities in the Belnap-Dunn logic. In PrŁ2Δ, every event φ has independent positive and negative measures that denote the likelihoods of φ and -φ, respectively. In 4PrŁΔ, the measures of the events are treated as partitions of the sample into four exhaustive and mutually exclusive parts corresponding to pure belief, pure disbelief, conflict and uncertainty of an agent in φ. In addition to that, we discuss two logics for the paraconsistent reasoning with belief and plausibility functions from Bílková et al. ((2023d). Annals of Pure and Applied Logic, 103338.) - BelŁ2Δ and BelNŁ. Both these logics equip events with two measures (positive and negative) with their main difference being that in BelŁ2Δ, the negative measure of φ is defined as the belief in -φ while in BelNŁ, it is treated independently as the plausibility of -φ.We provide a sound and complete Hilbert-style axiomatisation of 4PrŁΔand establish faithful translations between it and PrŁ2Δ. We also show that the validity problem in all the logics is coNP-complete.

Klasifikace

  • Druh

    J<sub>imp</sub> - Článek v periodiku v databázi Web of Science

  • CEP obor

  • OECD FORD obor

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Návaznosti výsledku

  • Projekt

    <a href="/cs/project/GF22-23022L" target="_blank" >GF22-23022L: Koaliční a epistemické logiky: intenzionální přístup ke skupinám</a><br>

  • Návaznosti

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Ostatní

  • Rok uplatnění

    2025

  • Kód důvěrnosti údajů

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

Údaje specifické pro druh výsledku

  • Název periodika

    Mathematical Structures in Computer Science

  • ISSN

    0960-1295

  • e-ISSN

    1469-8072

  • Svazek periodika

    35

  • Číslo periodika v rámci svazku

    April 2025

  • Stát vydavatele periodika

    GB - Spojené království Velké Británie a Severního Irska

  • Počet stran výsledku

    35

  • Strana od-do

    e1

  • Kód UT WoS článku

    001467324500001

  • EID výsledku v databázi Scopus

    2-s2.0-105002408352