Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Probabilistic semantics for nonmonotonic reasoning: a survey
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Reasoning about knowledge
Modal probability, belief, and actions
Fundamenta Informaticae
Statistical foundations for default reasoning
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Sequential thresholds: context sensitive default extensions
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
| Hi-index | 0.00 |
Much of our everyday knowledge is risky. This not only includes personal judgments, but the results of measurement, data obtained from references or by report, the results of statistical testing, etc. There are two (often opposed) views in artificial intelligence on how to handle risky empirical knowledge. One view, characterized often by modal or nonmonotonic logics, is that the structure of such knowledge should be captured by the formal logical properties of a set of sentences, if we can just get the logic right. The other view takes probability to be central to the characterization of risky knowledge, but often does not allow for the tentative or corrigible acceptance of a set of sentences. We examine a view, based on @e-acceptability, that combines both probability and modality. A statement is @e-accepted if the probability of its denial is at most @e, where @e is taken to be a fixed small parameter as is customary in the practice of statistical testing. We show that given a body of evidence @C"@d and a threshold @e, the set of @e-accepted statements @C"@e gives rise to the logical structure of the classical modal system EMN, the smallest classical modal system E supplemented by the axiom schemas M: @?"@e(@f@?@j)-(@?"@e@f@?@?"@e@j) and N: @?"@e@?.