Skip to Main content Skip to Navigation
Directions of work or proceedings

Penalty logic and its link with Dempster-Shafer theory

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 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.
Document type :
Directions of work or proceedings
Complete list of metadata
Contributor : Migration ProdInra Connect in order to contact the contributor
Submitted on : Sunday, June 7, 2020 - 5:55:05 PM
Last modification on : Thursday, March 17, 2022 - 1:44:02 PM


  • HAL Id : hal-02845574, version 1
  • PRODINRA : 136054



F. Dupin de Saint-Cyr, Jérôme Lang, Thomas Schiex. Penalty logic and its link with Dempster-Shafer theory. 10. International Conference on Uncertainty in AI Artificial Intelligence, Jul 1994, Washington, United States. n.p., 1994. ⟨hal-02845574⟩



Record views