Conditional deduction under uncertainty

23Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Conditional deduction in binary logic basically consists of deriving new statements from an existing set of statements and conditional rules. Modus Ponens, which is the classical example of a conditional deduction rule, expresses a conditional relationship between an antecedent and a consequent. A generalisation of Modus Ponens to probabilities in the form of probabilistic conditional inference is also well known. This paper describes a method for conditional deduction with beliefs which is a generalisation of probabilistic conditional inference and Modus Ponens. Meaningful conditional deduction requires a degree of relevance between the antecedent and the consequent, and this relevance can be explicitly expressed and measured with our method. Our belief representation has the advantage that it is possible to represent partial ignorance regarding the truth of statements, and is therefore suitable to model typical real life situations. Conditional deduction with beliefs thereby allows partial ignorance to be included in the analysis and deduction of statements and hypothesis. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Jøsang, A., Pope, S., & Daniel, M. (2005). Conditional deduction under uncertainty. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3571 LNAI, pp. 824–835). Springer Verlag. https://doi.org/10.1007/11518655_69

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free