AILOPRMay 30, 2022

Updating belief functions over Belnap--Dunn logic

arXiv:2205.15159v1h-index: 10
Originality Synthesis-oriented
AI Analysis

This work addresses a specific issue in reasoning under uncertainty for domains with contradictory data, but it appears incremental as it builds on prior generalizations of belief functions to Belnap-Dunn logic.

The paper tackles the problem of updating belief functions when dealing with incomplete and contradictory information, presenting a first approach using a frame semantics of Belnap-Dunn logic.

Belief and plausibility are weaker measures of uncertainty than that of probability. They are motivated by the situations when full probabilistic information is not available. However, information can also be contradictory. Therefore, the framework of classical logic is not necessarily the most adequate. Belnap-Dunn logic was introduced to reason about incomplete and contradictory information. Klein et al and Bilkova et al generalize the notion of probability measures and belief functions to Belnap-Dunn logic, respectively. In this article, we study how to update belief functions with new pieces of information. We present a first approach via a frame semantics of Belnap-Dunn logic.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes