Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Defaults and probabilities: extensions and coherence
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Probabilistic semantics for nonmonotonic reasoning: a survey
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Artificial Intelligence - Special issue on knowledge representation
What does a conditional knowledge base entail?
Artificial Intelligence
Conditional entailment: bridging two approaches to default reasoning
Artificial Intelligence
Some direct theories of nonmonotonic inheritance
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Plausibility measures and default reasoning
Journal of the ACM (JACM)
System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning
TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
Causal theories of action and change
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
| Hi-index | 0.00 |
A default conditional α → β has most often been informally interpreted as a defeasible version of a classical conditional, usually the material conditional. That is, the intuition is that a default should behave (implicitly or explicitly) as its (say) material counterpart "by default" or unless explicitly overridden. In this paper, we develop an alternative interpretation, in which a default is regarded more like a rule, leading from premises to conclusion. To this end, a general semantic framework under a "rule-based" interpretation is developed, and a family of weak conditional logics is specified, along with associated proof theories. Nonmonotonic inference is defined very easily in these logics. One obtains a rich set of nonmonotonic inferences concerning the incorporation of irrelevant properties and of property inheritance. Moreover, this interpretation resolves problems that have been associated with previous approaches.