Defeasible reasoning and decision support systems
Decision Support Systems
Probabilistic semantics for nonmonotonic reasoning: a survey
Readings in uncertain reasoning
Representing and reasoning with probabilistic knowledge: a logical approach to probabilities
Representing and reasoning with probabilistic knowledge: a logical approach to probabilities
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
On Estimating Probabilities in Tree Pruning
EWSL '91 Proceedings of the European Working Session on Machine Learning
Bayes and Pseudo-Bayes Estimates of Conditional Probabilities and Their Reliability
ECML '93 Proceedings of the European Conference on Machine Learning
Using Maximum Entropy in a Defeasible Logic with Probabilistic Semantics
IPMU '92 Proceedings of the 4th International Conference on Processing and Management of Uncertainty in Knowledge-Based Systems: Advanced Methods in Artificial Intelligence
A Conceptualization of Preferences in Non-Monotonic Proof Theory
JELIA '92 Proceedings of the European Workshop on Logics in AI
Using Defeasible Logic for a Window on a Probabilistic Database: Some Preliminary Notes
ECSQAU Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Abduction in Labelled Deductive Systems - A Conceptual Abstract
ECSQAU Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
On the comparison of theories: preferring the most specific explanation
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
For non-monotonic reasoning, explicit orderings over formulae offer an important solution to problems such as 'multiple extensions'. However, a criticism of such a solution is that it is not clear, in general, from where the orderings should be obtained. Here we show how orderings can be derived from statistical information about the domain which the formulae cover. For this we provide an overview of prioritized logics--a general class of logics that incorporate explicit orderings over formulae. This class of logics has been shown elsewhere to capture a wide variety of proof-theoretic approaches to non-monotonic reasoning, and in particular, to highlight the role of preferences-both implicit and explicit--in such proof theory. We take one particular prioritized logic, called SF logic, and describe an experimental approach for comparing this logic with an important example of a logic that does not use explicit orderings of preference-namely Horn clause logic with negation-as-failure. Finally, we present the results of this companson, showmg how SF logic is more skeptical and more accurate than negation-as-failure.