Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
Penalty logic and its Link with Dempster-Shafer Theory
Florence Dupin de Saint-Cyr, Jerome Lang, Thomas Schiex
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.
Pages: 204-211
PS Link:
PDF Link: /papers/94/p204-dupin_de_saint-cyr.pdf
@INPROCEEDINGS{Dupin de Saint-Cyr94,
AUTHOR = "Florence Dupin de Saint-Cyr and Jerome Lang and Thomas Schiex",
TITLE = "Penalty logic and its Link with Dempster-Shafer Theory",
BOOKTITLE = "Proceedings of the Tenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-94)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "1994",
PAGES = "204--211"

hosted by DSL   •   site info   •   help