What does a conditional knowledge base entail?
Artificial Intelligence
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Nonmonotonic inference based on expectations
Artificial Intelligence
The complexity of logic-based abduction
Journal of the ACM (JACM)
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Default Logic and Dempster-Shafer Theory
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Preferred subtheories: an extended logical framework for default reasoning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Domain-independent extensions to GSAT: solving large structured satisfiability problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Inconsistency management and prioritized syntax-based entailment
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Propositional non-monotonic reasoning and inconsistency in symmetric neural networks
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A new method for solving hard satisfiability problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Quasi-Possibilistic Logic and its Measures of Information and Conflict
Fundamenta Informaticae - The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)
Dempster-Shafer theory with smoothness
IUKM'13 Proceedings of the 2013 international conference on Integrated Uncertainty in Knowledge Modelling and Decision Making
| Hi-index | 0.00 |
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.