# Penalty logic and its Link with Dempster-Shafer Theory

arXiv: https://arxiv.org/abs/1302.6804 · HTML: https://mlsanity.com/paper/1302.6804/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Feb 2013.

## Built on by (most cited first, 1 of 1)

- [Reasoning about unpredicted change and explicit time](https://mlsanity.com/paper/2407.06622/) (2024)

## Abstract (arXiv)

Penalty logic, introduced by Pinkas, associates to each formula of a knowledge base the price to pay if this formula is violated. Penalties may be used as a criterion for selecting preferred consistent subsets in an inconsistent knowledge base, thus inducing a non-monotonic inference relation. A precise formalization and the main properties of penalty logic and of its associated non-monotonic inference relation are given in the first part. We also show that penalty logic and Dempster-Shafer theory are related, especially in the infinitesimal case.