Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Robust reasoning with rules that have exceptions: From second-order probability to argumentation via upper envelopes of probability and possibility plus directed graphs

Robust reasoning with rules that have exceptions: From second-order probability to argumentation... 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

Robust reasoning with rules that have exceptions: From second-order probability to argumentation via upper envelopes of probability and possibility plus directed graphs

Download PDF
89 pages

Loading next page...
 
/lp/springer-journals/robust-reasoning-with-rules-that-have-exceptions-from-second-order-gFpw32KiHf

References (62)

Publisher
Springer Journals
Copyright
Copyright © 2006 by Springer Science+Business Media, Inc.
Subject
Computer Science; Complexity; Computer Science, general ; Mathematics, general; Artificial Intelligence (incl. Robotics)
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1007/s10472-005-9008-8
Publisher site
See Article on Publisher Site

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.

Journal

Annals of Mathematics and Artificial Intelligence – Springer Journals

Published: Jan 18, 2006

There are no references for this article.