Reasoning about change: time and causation from the standpoint of artificial intelligence
Reasoning about change: time and causation from the standpoint of artificial intelligence
General theory of cumulative inference
Proceedings of the 2nd international workshop on Non-monotonic reasoning
Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Qualitative probabilities: a normative framework for commonsense reasoning
Qualitative probabilities: a normative framework for commonsense reasoning
A preference-based approach to default reasoning: preliminary report
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Default reasoning: causal and conditional theories
Default reasoning: causal and conditional theories
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
Measures of inconsistency and defaults
International Journal of Approximate Reasoning
Coping with the limitations of rational inference in the framework of possibility theory
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
| Hi-index | 0.00 |
When specificity considerations are incorporated in default reasoning systems, it is hard to ensure that exceptional subclasses inherit all legitimate features of their parent classes To reconcile these two requirements specificity and inheritance, this paper proposes the addition of a new rule called coherence rule, to the desiderata for default inference The coherence rule captures the intuition that formulae which are more compatible with the defaults in the database are more believable. We offer a formal definition of this extended desiderata and analyze the behavior of its associated closure relation which we call coference closure. We provide a concrete embodiment of a system satisfying the extended desiderata by taking the coherence closure of system Z A procedure for computing the (unique) most compact, be lief ranking in the coherence closure of system Z is also described.