Penalty logic and its Link with Dempster-Shafer Theory
Artificial Intelligence
2013-02-28 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1302.6804,
title = {Penalty logic and its Link with Dempster-Shafer Theory},
author = {Florence Dupin de Saint-Cyr and Jerome Lang and Thomas Schiex},
journal= {arXiv preprint arXiv:1302.6804},
year = {2013}
}
Comments
Appears in Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence (UAI1994)