Penalty Logic and Its Link with Dempster-Shafer Theory

Florence Dupin de Saint-Cyr, Jérôme Lang, Thomas Schiex

UAI 1994 pp. 204-211

doi:10.1016/B978-1-55860-332-5.50031-6 /uai/1994/desaintcyr1994uai-penalty/

Abstract

Penalty logic, introduced by Pinkas [17], 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 nonmonotonic 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.

PDF UAI Semantic Scholar

Cite

Text

de Saint-Cyr et al. "Penalty Logic and Its Link with Dempster-Shafer Theory." Conference on Uncertainty in Artificial Intelligence, 1994. doi:10.1016/B978-1-55860-332-5.50031-6

Markdown

[de Saint-Cyr et al. "Penalty Logic and Its Link with Dempster-Shafer Theory." Conference on Uncertainty in Artificial Intelligence, 1994.](https://mlanthology.org/uai/1994/desaintcyr1994uai-penalty/) doi:10.1016/B978-1-55860-332-5.50031-6

BibTeX

@inproceedings{desaintcyr1994uai-penalty,
  title     = {{Penalty Logic and Its Link with Dempster-Shafer Theory}},
  author    = {de Saint-Cyr, Florence Dupin and Lang, Jérôme and Schiex, Thomas},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1994},
  pages     = {204-211},
  doi       = {10.1016/B978-1-55860-332-5.50031-6},
  url       = {https://mlanthology.org/uai/1994/desaintcyr1994uai-penalty/}
}