
Abductive reasoning
Abductive reasoning (also called abduction,[1] abductive inference,[1] or retroduction[2]) is a form of logical inference that seeks the simplest and most likely conclusion from a set of observations. It was formulated and advanced by American philosopher and logician Charles Sanders Peirce beginning in the latter half of the 19th century.
"Abductive" redirects here. For other uses, see Abduction (disambiguation).
Abductive reasoning, unlike deductive reasoning, yields a plausible conclusion but does not definitively verify it. Abductive conclusions do not eliminate uncertainty or doubt, which is expressed in retreat terms such as "best available" or "most likely". While inductive reasoning draws general conclusions that apply to many situations, abductive conclusions are confined to the particular observations in question.
In the 1990s, as computing power grew, the fields of law,[3] computer science, and artificial intelligence research[4] spurred renewed interest in the subject of abduction.[5]
Diagnostic expert systems frequently employ abduction.[6]
Formalizations of abduction[edit]
Logic-based abduction[edit]
In logic, explanation is accomplished through the use of a logical theory representing a domain and a set of observations . Abduction is the process of deriving a set of explanations of according to and picking out one of those explanations. For to be an explanation of according to , it should satisfy two conditions:
Applications[edit]
Artificial intelligence[edit]
Applications in artificial intelligence include fault diagnosis, belief revision, and automated planning. The most direct application of abduction is that of automatically detecting faults in systems: given a theory relating faults with their effects and a set of observed effects, abduction can be used to derive sets of faults that are likely to be the cause of the problem.[4]
Automated planning[edit]
Abduction can also be used to model automated planning.[56] Given a logical theory relating action occurrences with their effects (for example, a formula of the event calculus), the problem of finding a plan for reaching a state can be modeled as the problem of abducting a set of literals implying that the final state is the goal state.
Intelligence analysis[edit]
In intelligence analysis, analysis of competing hypotheses and Bayesian networks, probabilistic abductive reasoning is used extensively. Similarly in medical diagnosis and legal reasoning, the same methods are being used, although there have been many examples of errors, especially caused by the base rate fallacy and the prosecutor's fallacy.