The next talk of our seminar series will be given by Sabine Frittella (INSA Centre Val de Loire) via Teams (please, see details below) on Monday, February 26th, starting from 12:30 (Milan time). Here it is the title and the abstract of her talk:
Title: Probabilistic reasoning with incomplete and contradictory information
Abstract: Belnap-Dunn logic (BD) [1] was designed to reason about incomplete and contradictory information. It is a paracomplete and paraconsistent propositional logic, that is, BD is a propositional logic that satisfies the same axioms as classical propositional logic except for the principle of explosion and the law of excluded middle. In this talk, we will discuss probabilistic reasoning over BD. In the first part of the talk, we provide preliminaries on BD and probabilities over BD, and we present two-layered logics and how to use them to formalize probabilistic reasoning [2,3]. In the second part, we introduce belief functions (a generalization of probability measures) and discuss how to define and interpret them over BD [2,4].
[1] Belnap, N.D. (2019). How a Computer Should Think. In: Omori, H., Wansing, H. (eds) New Essays on Belnap-Dunn Logic. Synthese Library, vol 418. Springer, Cham.
[2] Marta Bílková, Sabine Frittella, Daniil Kozhemiachenko, Ondrej Majer, Sajad Nazari: Reasoning with belief functions over Belnap–Dunn logic, Annals of Pure and Applied Logic, 2023.
[3] Marta Bílková, Sabine Frittella, Daniil Kozhemiachenko, Ondrej Majer: Two-Layered Logics for Paraconsistent Probabilities. WoLLIC 2023: 101-117
[4] Marta Bílková, Sabine Frittella, Daniil Kozhemiachenko, Ondrej Majer, Krishna Manoorkar: Describing and quantifying contradiction between pieces of evidence via Belnap Dunn logic and Dempster-Shafer theory. ISIPTA 2023: 37-47
