Penalty logic and its Link with Dempster-Shafer Theory
Lists
Only you see this
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.
BibTeX
@inproceedings{saintcyr1994penalty,
author = {Florence Dupin de Saint-Cyr and Jérôme Lang and Thomas Schiex},
title = {{Penalty logic and its Link with Dempster-Shafer Theory}},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {1994},
url = {https://openreview.net/forum?id=E5YDlv6S0S},
}Loading related content...