Skip to main content
eScholarship
Open Access Publications from the University of California

Robust Reasoning with Rules that Have Rare Exceptions:

No data is associated with this publication.
Abstract

Rules having rare exceptions may be interpreted as assertions of high conditional probability. In other words, a rule If X then Y may be interpreted as meaning that Pr(Y |X) ≈ 1. A general approach to reasoning with such rules, based on second-order probability, is advocated. Within this general approach, different reasoning methods are needed, with the selection of a specific method being dependent upon what knowledge is available about the relative sizes, across rules, of upper bounds on each rule’s exception probabilities Pr(¬Y |X). A method of reasoning, entailment with universal near surety, is formulated for the case when no information is available concerning the relative sizes of upper bounds on exception probabilities. Any conclusion attained under these conditions is robust in the sense that it will still be attained if information about the relative sizes of exception probability bounds becomes available. It is shown that reasoning via entailment with universal near surety is equivalent to reasoning in a particular type of argumentation system having the property that when two subsets of the rule base conflict with each other, the effectively more specific subset overrides the other. As stepping stones toward attaining this argumentation result, theorems are proved characterizing entailment with universal near surety in terms of upper envelopes of probability measures, upper envelopes of possibility measures, and directed graphs. In addition, various attributes of entailment with universal near surety, including property inheritance, are examined.



The text for this item is currently unavailable.