Abduction[1] is a form of logical inference that goes from data description of something to a hypothesis that accounts for the data. The term was first introduced by the American philosopher Charles Sanders Peirce (1839–1914) as "guessing".[2] Peirce said that to abduce a hypothetical explanation Failed to parse (Missing texvc executable; please see math/README to configure.): a
from an observed surprising circumstance Failed to parse (Missing texvc executable; please see math/README to configure.): b
is to surmise that Failed to parse (Missing texvc executable; please see math/README to configure.): a
may be true because then Failed to parse (Missing texvc executable; please see math/README to configure.): b
would be a matter of course.[3] Thus, to abduce Failed to parse (Missing texvc executable; please see math/README to configure.): a
from Failed to parse (Missing texvc executable; please see math/README to configure.): b
involves determining that Failed to parse (Missing texvc executable; please see math/README to configure.): a
is sufficient (or nearly sufficient), but not necessary, for Failed to parse (Missing texvc executable; please see math/README to configure.): b
.
For example, the lawn is wet. But if it rained last night, then it would be unsurprising that the lawn is wet. Therefore, by abductive reasoning, the possibility that it rained last night is reasonable. (But note that Peirce did not remain convinced that a single logical form covers all abduction.)[4]
Peirce argues that good abductive reasoning from P to Q involves not simply a determination that, e.g., Q is sufficient for P, but also that Q is among the most economical explanations for P. Simplification and economy are what call for the 'leap' of abduction.[5]
There has been renewed interest in the subject of abduction in the fields of law,[6] computer science, and artificial intelligence research.[7]
- Deduction
- allows deriving Failed to parse (Missing texvc executable; please see math/README to configure.): b
from Failed to parse (Missing texvc executable; please see math/README to configure.): a
only where Failed to parse (Missing texvc executable; please see math/README to configure.): b
is a formal consequence of Failed to parse (Missing texvc executable; please see math/README to configure.): a
. In other words, deduction is the process of deriving the consequences of what is assumed. Given the truth of the assumptions, a valid deduction guarantees the truth of the conclusion. For example, given that all bachelors are unmarried males, and given that this person is a bachelor, it can be deduced that this person is an unmarried male.
- Induction
- allows inferring Failed to parse (Missing texvc executable; please see math/README to configure.): b
from Failed to parse (Missing texvc executable; please see math/README to configure.): a
, where Failed to parse (Missing texvc executable; please see math/README to configure.): b
does not follow necessarily from Failed to parse (Missing texvc executable; please see math/README to configure.): a
. Failed to parse (Missing texvc executable; please see math/README to configure.): a
might give us very good reason to accept Failed to parse (Missing texvc executable; please see math/README to configure.): b
, but it does not ensure Failed to parse (Missing texvc executable; please see math/README to configure.): b . For example, if all of the swans that we have observed so far are white, we may induce that the possibility that all swans are white is reasonable. We have good reason to believe the conclusion from the premise, but the truth of the conclusion is not guaranteed. (Indeed, it turns out that some swans are black.)
- Abduction
- allows inferring Failed to parse (Missing texvc executable; please see math/README to configure.): a
as an explanation of Failed to parse (Missing texvc executable; please see math/README to configure.): b
. Because of this, abduction allows the precondition Failed to parse (Missing texvc executable; please see math/README to configure.): a
to be abduced from the consequence Failed to parse (Missing texvc executable; please see math/README to configure.): b
. Deduction and abduction thus differ in the direction in which a rule like "Failed to parse (Missing texvc executable; please see math/README to configure.): a
entails Failed to parse (Missing texvc executable; please see math/README to configure.): b
" is used for inference. As such abduction is formally equivalent to the logical fallacy affirming the consequent or Post hoc ergo propter hoc, because there are multiple possible explanations for Failed to parse (Missing texvc executable; please see math/README to configure.): b . For example, after glancing up and seeing the eight ball moving towards us we may abduce that it was struck by the cue ball. The cue ball's strike would account for the eight ball's movement. It serves as a hypothesis that explains our observation. There are in fact infinitely many possible explanations for the eight ball's movement, and so our abduction does not leave us certain that the cue ball did in fact strike the eight ball, but our abduction is still useful and can serve to orient us in our surroundings. This process of abduction is an instance of the scientific method. There are infinite possible explanations for any of the physical processes we observe, but we are inclined to abduce a single explanation (or a few explanations) for them in the hope that we can better orient ourselves in our surroundings and eliminate some of the possibilities.
In logic, explanation is done from a logical theory Failed to parse (Missing texvc executable; please see math/README to configure.): T
representing a domain and a set of observations Failed to parse (Missing texvc executable; please see math/README to configure.): O
. Abduction is the process of deriving a set of explanations of Failed to parse (Missing texvc executable; please see math/README to configure.): O
according to Failed to parse (Missing texvc executable; please see math/README to configure.): T
and picking out one of those explanations. For Failed to parse (Missing texvc executable; please see math/README to configure.): E
to be an explanation of Failed to parse (Missing texvc executable; please see math/README to configure.): O
according to Failed to parse (Missing texvc executable; please see math/README to configure.): T
, it should satisfy two conditions:
- Failed to parse (Missing texvc executable; please see math/README to configure.): O
follows from Failed to parse (Missing texvc executable; please see math/README to configure.): E
and Failed to parse (Missing texvc executable; please see math/README to configure.): T
- Failed to parse (Missing texvc executable; please see math/README to configure.): E
is consistent with Failed to parse (Missing texvc executable; please see math/README to configure.): T
.
In formal logic, Failed to parse (Missing texvc executable; please see math/README to configure.): O
and Failed to parse (Missing texvc executable; please see math/README to configure.): E
are assumed to be sets of literals. The two conditions for Failed to parse (Missing texvc executable; please see math/README to configure.): E
being an explanation of Failed to parse (Missing texvc executable; please see math/README to configure.): O
according to theory Failed to parse (Missing texvc executable; please see math/README to configure.): T
are formalized as:
- Failed to parse (Missing texvc executable; please see math/README to configure.): T \cup E \models O
- Failed to parse (Missing texvc executable; please see math/README to configure.): T \cup E
is consistent.
Among the possible explanations Failed to parse (Missing texvc executable; please see math/README to configure.): E
satisfying these two conditions, some other condition of minimality is usually imposed to avoid irrelevant facts (not contributing to the entailment of Failed to parse (Missing texvc executable; please see math/README to configure.): O
) being included in the explanations. Abduction is then the process that picks out some member of Failed to parse (Missing texvc executable; please see math/README to configure.): E . Criteria for picking out a member representing "the best" explanation include the simplicity, the prior probability, or the explanatory power of the explanation.
A proof theoretical abduction method for first order classical logic based on the sequent calculus and a dual one, based on semantic tableaux (analytic tableaux) have been proposed (Cialdea Mayer & Pirri 1993). The methods are sound and complete and work for full first order logic, without requiring any preliminary reduction of formulae into normal forms. These methods have also been extended to modal logic.
Abductive logic programming is a computational framework that extends normal logic programming with abduction. It separates the theory Failed to parse (Missing texvc executable; please see math/README to configure.): T
into two components, one of which is a normal logic program, used to generate Failed to parse (Missing texvc executable; please see math/README to configure.): E
by means of backward reasoning, the other of which is a set of integrity constraints, used to filter the set of candidate explanations.
A different formalization of abduction is based on inverting the function that calculates the visible effects of the hypotheses. Formally, we are given a set of hypotheses Failed to parse (Missing texvc executable; please see math/README to configure.): H
and a set of manifestations Failed to parse (Missing texvc executable; please see math/README to configure.): M
- they are related by the domain knowledge, represented by a function Failed to parse (Missing texvc executable; please see math/README to configure.): e
that takes as an argument a set of hypotheses and gives as a result the corresponding set of manifestations. In other words, for every subset of the hypotheses Failed to parse (Missing texvc executable; please see math/README to configure.): H' \subseteq H
, their effects are known to be Failed to parse (Missing texvc executable; please see math/README to configure.): e(H') .
Abduction is performed by finding a set Failed to parse (Missing texvc executable; please see math/README to configure.): H' \subseteq H
such that Failed to parse (Missing texvc executable; please see math/README to configure.): M \subseteq e(H')
. In other words, abduction is performed by finding a set of hypotheses Failed to parse (Missing texvc executable; please see math/README to configure.): H'
such that their effects Failed to parse (Missing texvc executable; please see math/README to configure.): e(H')
include all observations Failed to parse (Missing texvc executable; please see math/README to configure.): M
.
A common assumption is that the effects of the hypotheses are independent, that is, for every Failed to parse (Missing texvc executable; please see math/README to configure.): H' \subseteq H , it holds that Failed to parse (Missing texvc executable; please see math/README to configure.): e(H') = \bigcup_{h \in H'} e(\{h\}) . If this condition is met, abduction can be seen as a form of set covering.
Abductive validation is the process of validating a given hypothesis through abductive reasoning. This can also be called reasoning through successive approximation. Under this principle, an explanation is valid if it is the best possible explanation of a set of known data. The best possible explanation is often defined in terms of simplicity and elegance (see Occam's razor). Abductive validation is common practice in hypothesis formation in science; moreover, Peirce argues it is a ubiquitous aspect of thought:
Looking out my window this lovely spring morning I see an azalea in full bloom. No, no! I do not see that; though that is the only way I can describe what I see. That is a proposition, a sentence, a fact; but what I perceive is not proposition, sentence, fact, but only an image, which I make intelligible in part by means of a statement of fact. This statement is abstract; but what I see is concrete. I perform an abduction when I so much as express in a sentence anything I see. The truth is that the whole fabric of our knowledge is one matted felt of pure hypothesis confirmed and refined by induction. Not the smallest advance can be made in knowledge beyond the stage of vacant staring, without making an abduction at every step.[8]
It was Peirce's own maxim that "Facts cannot be explained by a hypothesis more extraordinary than these facts themselves; and of various hypotheses the least extraordinary must be adopted."[9] After obtaining results from an inference procedure, we may be left with multiple assumptions, some of which may be contradictory. Abductive validation is a method for identifying the assumptions that will lead to your goal.
Probabilistic abductive reasoning is a form of abductive validation, and is used extensively in areas where conclusions about possible hypotheses need to be derived, such as for making diagnoses from medical tests. For example, a pharmaceutical company that develops a test for a particular infectious disease will typically determine the reliability of the test by letting a group of infected and a group of non-infected people undergo the test. Assume the statements Failed to parse (Missing texvc executable; please see math/README to configure.): x
- "Positive test", Failed to parse (Missing texvc executable; please see math/README to configure.): \overline{x}
- "Negative test", Failed to parse (Missing texvc executable; please see math/README to configure.): y
- "Infected", and Failed to parse (Missing texvc executable; please see math/README to configure.): \overline{y}
- "Not infected". The result of these trials will then determine the reliability of the test in terms of its sensitivity Failed to parse (Missing texvc executable; please see math/README to configure.): p(x|y)
and false positive rate Failed to parse (Missing texvc executable; please see math/README to configure.): p(x|\overline{y})
. The interpretations of the conditionals are: Failed to parse (Missing texvc executable; please see math/README to configure.): p(x|y)
- "The probability of positive test given infection", and Failed to parse (Missing texvc executable; please see math/README to configure.): p(x|\overline{y})
- "The probability of positive test in the absence of infection". The problem with applying these conditionals in a practical setting is that they are expressed in the opposite direction to what the practitioner needs. The conditionals needed for making the diagnosis are: Failed to parse (Missing texvc executable; please see math/README to configure.): p(y|x)
- "The probability of infection given positive test", and Failed to parse (Missing texvc executable; please see math/README to configure.): p(y|\overline{x})
- "The probability of infection given negative test". The probability of infection could then have been conditionally deduced as Failed to parse (Missing texvc executable; please see math/README to configure.): p(y\|x) = p(x)p(y|x) + p(\overline{x})p(y|\overline{x})
, where "Failed to parse (Missing texvc executable; please see math/README to configure.): \| " denotes conditional deduction. Unfortunately the required conditionals are usually not directly available to the medical practitioner, but they can be obtained if the base rate of the infection in the population is known.
The required conditionals can be correctly derived by inverting the available conditionals using Bayes rule. The inverted conditionals are obtained as follows: Failed to parse (Missing texvc executable; please see math/README to configure.): \begin{cases} p(x|y) = \frac{p(x\land y)}{p(y)}\\ p(y|x) = \frac{p(x\land y)}{p(x)} \end{cases} \;\;\Rightarrow \;\;\;\; p(y|x) = \frac{p(y)p(x|y)}{p(x)}\;.
The term Failed to parse (Missing texvc executable; please see math/README to configure.): p(y)
on the right hand side of the equation expresses the base rate of
the infection in the population. Similarly, the term Failed to parse (Missing texvc executable; please see math/README to configure.): p(x)
expresses the default likelihood of
positive test on a random person in the population. In the expressions below Failed to parse (Missing texvc executable; please see math/README to configure.): a(y)
and Failed to parse (Missing texvc executable; please see math/README to configure.): a(\overline{y})=1-a(y)
denote the base rates of Failed to parse (Missing texvc executable; please see math/README to configure.): y
and its complement Failed to parse (Missing texvc executable; please see math/README to configure.): \overline{y}
respectively, so that e.g. Failed to parse (Missing texvc executable; please see math/README to configure.): p(x) = a(y)p(x|y) + a(\overline{y})p(x|\overline{y})
. The full expression for the required conditionals Failed to parse (Missing texvc executable; please see math/README to configure.): p(y|x)
and Failed to parse (Missing texvc executable; please see math/README to configure.): p(y|\overline{x})
are then:
Failed to parse (Missing texvc executable; please see math/README to configure.): \begin{cases} p(y|x) = \frac{a(y)p(x|y)}{a(y)p(x|y) + a(\overline{y})p(x|\overline{y})}\\ p(y|\overline{x}) = \frac{a(y)p(\overline{x}|y)}{a(y)p(\overline{x}|y) + a(\overline{y})p(\overline{x}|\overline{y})} \end{cases}
The full expression for the conditionally abduced probability of infection in a tested person, expressed as Failed to parse (Missing texvc executable; please see math/README to configure.): p(y\overline{\|}x) , given the outcome of the test, the base rate of the infection, as well as the test's sensitivity and false positive rate, is then given by: Failed to parse (Missing texvc executable; please see math/README to configure.): p(y\overline{\|}x) = p(x)\left(\frac{a(y)p(x|y)}{a(y)p(x|y) + a(\overline{y})p(x|\overline{y})}\right) + p(\overline{x})\left(\frac{a(y)p(\overline{x}|y)}{a(y)p(\overline{x}|y) + a(\overline{y})p(\overline{x}|\overline{y})}\right) .
Probabilistic abduction can thus be described as a method for inverting conditionals in order to apply probabilistic deduction.
A medical test result is typically considered positive or negative, so when applying the above equation it can be assumed that either Failed to parse (Missing texvc executable; please see math/README to configure.): p(x) = 1
(positive) or Failed to parse (Missing texvc executable; please see math/README to configure.): p(\overline{x}) = 1
(negative). In
case the patient tests positive, the above equation can be simplified to Failed to parse (Missing texvc executable; please see math/README to configure.): p(y\overline{\|}x) = p(y|x)
which
will give the correct likelihood that the patient actually is infected.
The Base rate fallacy in medicine,[10] or the Prosecutor's fallacy[11] in legal reasoning, consists of making the erroneous assumption that Failed to parse (Missing texvc executable; please see math/README to configure.): p(y|x) = p(x|y) . While this reasoning error often can produce a relatively good approximation of the correct hypothesis probability value, it can lead to a completely wrong result and wrong conclusion in case the base rate is very low and the reliability of the test is not perfect. An extreme example of the base rate fallacy is to conclude that a male person is pregnant just because he tests positive in a pregnancy test. Obviously, the base rate of male pregnancy is zero, and assuming that the test is not perfect, it would be correct to conclude that the male person is not pregnant.
The expression for probabilistic abduction can be generalised to multinomial cases,[12] i.e., with a state space Failed to parse (Missing texvc executable; please see math/README to configure.): X
of multiple Failed to parse (Missing texvc executable; please see math/README to configure.): x_{i}
and a state space Failed to parse (Missing texvc executable; please see math/README to configure.): Y
of multiple states Failed to parse (Missing texvc executable; please see math/README to configure.): y_{j}
.
Subjective logic generalises probabilistic logic by including parameters for uncertainty in the input arguments. Abduction in subjective logic is thus similar to probabilistic abduction described above.[12] The input arguments in subjective logic are composite functions called subjective opinions which can be binomial when the opinion applies to a single proposition or multinomial when it applies to a set of propositions. A multinomial opinion thus applies to a frame Failed to parse (Missing texvc executable; please see math/README to configure.): X\,\!
(i.e. a state space of exhaustive and mutually disjoint propositions Failed to parse (Missing texvc executable; please see math/README to configure.): x_i\,\!
), and is denoted by the composite function Failed to parse (Missing texvc executable; please see math/README to configure.): \omega_{X}=(\vec{b}, u, \vec{a})\,\! , where Failed to parse (Missing texvc executable; please see math/README to configure.): \vec{b}\,\!
is a vector of belief masses over the propositions of Failed to parse (Missing texvc executable; please see math/README to configure.): X\,\!
, Failed to parse (Missing texvc executable; please see math/README to configure.): u\,\!
is the uncertainty mass, and Failed to parse (Missing texvc executable; please see math/README to configure.): \vec{a}\,\!
is a vector of base rate values over the propositions of Failed to parse (Missing texvc executable; please see math/README to configure.): X\,\!
. These components satisfy Failed to parse (Missing texvc executable; please see math/README to configure.): u+\sum \vec{b}(x_i) = 1\,\!
and Failed to parse (Missing texvc executable; please see math/README to configure.): \sum \vec{a}(x_i) = 1\,\!
as well as Failed to parse (Missing texvc executable; please see math/README to configure.): \vec{b}(x_i),u,\vec{a}(x_i) \in [0,1]\,\!
.
Assume the frames Failed to parse (Missing texvc executable; please see math/README to configure.): X
and Failed to parse (Missing texvc executable; please see math/README to configure.): Y
, the sets of conditional opinions Failed to parse (Missing texvc executable; please see math/README to configure.): \omega_{X|Y}
and Failed to parse (Missing texvc executable; please see math/README to configure.): \omega_{X|\overline{Y}}
, the opinion Failed to parse (Missing texvc executable; please see math/README to configure.): \omega_{X}
on Failed to parse (Missing texvc executable; please see math/README to configure.): X
, and the base rate function Failed to parse (Missing texvc executable; please see math/README to configure.): a_{Y}
on Failed to parse (Missing texvc executable; please see math/README to configure.): Y
. Based on these parameters, subjective logic provides a method for deriving the set of inverted conditionals Failed to parse (Missing texvc executable; please see math/README to configure.): \omega_{Y|X}
and Failed to parse (Missing texvc executable; please see math/README to configure.): \omega_{Y|\overline{X}}
. Using these inverted conditionals, subjective logic also provides a method for deduction. Abduction in subjective logic consists of inverting the conditionals and then applying deduction.
The symbolic notation for conditional abduction is "Failed to parse (Missing texvc executable; please see math/README to configure.): \overline{\|} ", and the operator itself is denoted as Failed to parse (Missing texvc executable; please see math/README to configure.): \overline{\circledcirc} . The expression for subjective logic abduction is then:[12] Failed to parse (Missing texvc executable; please see math/README to configure.): \omega_{Y\overline{\|}X}=\omega_{X}\;\overline{\circledcirc}\; (\omega_{X|Y},\omega_{X|\overline{Y}},a_{Y})\,\! .
The advantage of using subjective logic abduction compared to probabilistic abduction is that uncertainty about the probability values of the input arguments can be explicitly expressed and taken into account during the analysis. It is thus possible to perform abductive analysis in the presence of missing or incomplete input evidence, which normally results in degrees of uncertainty in the output conclusions.
The philosopher Charles Sanders Peirce (
/ˈpɜrs/; 1839–1914) introduced abduction into modern logic. Over the years he called such inference hypothesis, abduction, presumption, and retroduction. He considered it a topic in logic as a normative field in philosophy, not in purely formal or mathematical logic, and eventually as a topic also in economics of research.
As two stages of the development, extension, etc., of a hypothesis in scientific inquiry, abduction and induction are often collapsed into one overarching concept — the hypothesis. That is why, in the scientific method pioneered by Galileo and Bacon, the abductive stage of hypothesis formation is conceptualized simply as induction. In the twentieth century this collapse was reinforced by Karl Popper's explication of the hypothetico-deductive model, where the hypothesis is considered to be just "a guess"[13] (in the spirit of Peirce). However, when the formation of a hypothesis is considered the result of a process it becomes clear that this "guess" has already been tried and made more robust in thought as a necessary stage of its acquiring the status of hypothesis. Indeed many abductions are rejected or heavily modified by subsequent abductions before they ever reach this stage.
Before 1900, Peirce treated abduction as the use of a known rule to explain an observation, e.g., it is a known rule that if it rains the grass is wet; so, to explain the fact that the grass is wet; one infers that it has rained. This remains the common use of the term "abduction" in the social sciences and in artificial intelligence.
Peirce consistently characterized it as the kind of inference that originates a hypothesis by concluding in an explanation, though an unassured one, for some very curious or surprising (anomalous) observation stated in a premise. As early as 1865 he wrote that all conceptions of cause and force are reached through hypothetical inference; in the 1900s he wrote that all explanatory content of theories is reached through abduction. In other respects Peirce revised his view of abduction over the years.[14]
In later years his view came to be:
- Abduction is guessing.[2] It is "very little hampered" by rules of logic.[3] Even a well-prepared mind's individual guesses are oftener wrong than right.[15] But the success of our guesses far exceeds that of random luck and seems born of attunement to nature by instinct[16] (some speak of intuition in such contexts[17]).
- Abduction guesses a new or outside idea so as to account in a plausible, instinctive, economical way for a surprising or very complicated phenomenon. That is its proximate aim.[16]
- Its longer aim is to economize inquiry itself. Its rationale is inductive: it works often enough, is the only source of new ideas, and has no substitute in expediting the discovery of new truths.[18] Its rationale especially involves its role in coordination with other modes of inference in inquiry. It is inference to explanatory hypotheses for selection of those best worth trying.
- Pragmatism is the logic of abduction. Upon the generation of an explanation (which he came to regard as instinctively guided), the pragmatic maxim gives the necessary and sufficient logical rule to abduction in general. The hypothesis, being insecure, needs to have conceivable[19] implications for informed practice, so as to be testable[20][21] and, through its trials, to expedite and economize inquiry. The economy of research is what calls for abduction and governs its art.[5]
Writing in 1910, Peirce admits that "in almost everything I printed before the beginning of this century I more or less mixed up hypothesis and induction" and he traces the confusion of these two types of reasoning to logicians' too "narrow and formalistic a conception of inference, as necessarily having formulated judgments from its premises."[22]
He started out in the 1860s treating hypothetical inference in a number of ways which he eventually peeled away as inessential or, in some cases, mistaken:
- as inferring the occurrence of a character (a characteristic) from the observed combined occurrence of multiple characters which its occurrence would necessarily involve;[23] for example, if any occurrence of A is known to necessitate occurrence of B, C, D, E, then the observation of B, C, D, E suggests by way of explanation the occurrence of A. (But by 1878 he no longer regarded such multiplicity as common to all hypothetical inference.[24])
- as aiming for a more or less probable hypothesis (in 1867 and 1883 but not in 1878; anyway by 1900 the justification is not probability but the lack of alternatives to guessing and the fact that guessing is fruitful;[25] by 1903 he speaks of the "likely" in the sense of nearing the truth in an "indefinite sense";[26] by 1908 he discusses plausibility as instinctive appeal.[16]) In a paper dated by editors as circa 1901, he discusses "instinct" and "naturalness", along with the kind of considerations (low cost of testing, logical caution, breadth, and incomplexity) that he later calls methodeutical.[27]
- as induction from characters (but as early as 1900 he characterized abduction as guessing[25])
- as citing a known rule in a premise rather than hypothesizing a rule in the conclusion (but by 1903 he allowed either approach[3][28])
- as basically a transformation of a deductive categorical syllogism[24] (but in 1903 he offered a variation on modus ponens instead,[3] and by 1911 he was unconvinced that any one form covers all hypothetical inference[4]).
In 1867, in "The Natural Classification of Arguments",[23] hypothetical inference always deals with a cluster of characters (call them P′, P′′, P′′′, etc.) known to occur at least whenever a certain character (M) occurs. (Note that categorical syllogisms have elements traditionally called middles, predicates, and subjects. For example: All men [middle] are mortal [predicate]; Socrates [subject] is a man [middle]; ergo Socrates [subject] is mortal [predicate]". Below, 'M' stands for a middle; 'P' for a predicate; 'S' for a subject. Note also that Peirce held that all deduction can be put into the form of the categorical syllogism Barbara (AAA).)
| [Deduction].
[Any] M is P
[Any] S is M
Failed to parse (Missing texvc executable; please see math/README to configure.): \therefore
[Any] S is P.
|
Induction.
S′, S′′, S′′′, &c. are taken at random as M's;
S′, S′′, S′′′, &c. are P:
Failed to parse (Missing texvc executable; please see math/README to configure.): \therefore
Any M is probably P.
|
Hypothesis.
Any M is, for instance, P′, P′′, P′′′, &c.;
S is P′, P′′, P′′′, &c.:
Failed to parse (Missing texvc executable; please see math/README to configure.): \therefore
S is probably M.
|
In 1878, in "Deduction, Induction, and Hypothesis",[24] there is no longer a need for multiple characters or predicates in order for an inference to be hypothetical, although it is still helpful. Moreover Peirce no longer poses hypothetical inference as concluding in a probable hypothesis. In the forms themselves, it is understood but not explicit that induction involves random selection and that hypothetical inference involves response to a "very curious circumstance". The forms instead emphasize the modes of inference as rearrangements of one another's propositions (without the bracketed hints shown below).
| Deduction.
Rule: All the beans from this bag are white.
Case: These beans are from this bag.
Failed to parse (Missing texvc executable; please see math/README to configure.): \therefore
Result: These beans are white.
|
Induction.
Case: These beans are [randomly selected] from this bag.
Result: These beans are white.
Failed to parse (Missing texvc executable; please see math/README to configure.): \therefore
Rule: All the beans from this bag are white.
|
Hypothesis.
Rule: All the beans from this bag are white.
Result: These beans [oddly] are white.
Failed to parse (Missing texvc executable; please see math/README to configure.): \therefore
Case: These beans are from this bag.
|
Peirce long treated abduction in terms of induction from characters or traits (weighed, not counted like objects), explicitly so in his influential 1883 "A Theory of Probable Inference", in which he returns to involving probability in the hypothetical conclusion.[29] Like "Deduction, Induction, and Hypothesis" in 1878, it was widely read (see the historical books on statistics by Stephen Stigler), unlike his later amendments of his conception of abduction. Today abduction remains most commonly understood as induction from characters and extension of a known rule to cover unexplained circumstances.
In 1902 Peirce wrote that he now regarded the syllogistical forms and the doctrine of extension and comprehension (i.e., objects and characters as referenced by terms), as being less fundamental than he had earlier thought.[30] In 1903 he offered the following form for abduction:[3]
The surprising fact, C, is observed;
- But if A were true, C would be a matter of course,
- Hence, there is reason to suspect that A is true.
The hypothesis is framed, but not asserted, in a premise, then asserted as rationally suspectable in the conclusion. Thus, as in the earlier categorical syllogistic form, the conclusion is formulated from some premise(s). But all the same the hypothesis consists more clearly than ever in a new or outside idea beyond what is known or observed. Induction in a sense goes beyond observations already reported in the premises, but it merely amplifies ideas already known to represent occurrences, or tests an idea supplied by hypothesis; either way it requires previous abductions in order to get such ideas in the first place. Induction seeks facts to test a hypothesis; abduction seeks a hypothesis to account for facts.
Note that the hypothesis ("A") could be of a rule. It need not even be a rule strictly necessitating the surprising observation ("C"), which needs to follow only as a "matter of course"; or the "course" itself could amount to some known rule, merely alluded to, and also not necessarily a rule of strict necessity. In the same year, Peirce wrote that reaching a hypothesis may involve placing a surprising observation under either a newly hypothesized rule or a hypothesized combination of a known rule with a peculiar state of facts, so that the phenomenon would be not surprising but instead either necessarily implied or at least likely.[28]
Peirce did not remain quite convinced about any such form as the categorical syllogistic form or the 1903 form. In 1911, he wrote, "I do not, at present, feel quite convinced that any logical form can be assigned that will cover all "Retroductions". For what I mean by a Retroduction is simply a conjecture which arises in the mind."[4]
In 1901 Peirce wrote, "There would be no logic in imposing rules, and saying that they ought to be followed, until it is made out that the purpose of hypothesis requires them."[31] In 1903 Peirce called pragmatism "the logic of abduction" and said that the pragmatic maxim gives the necessary and sufficient logical rule to abduction in general.[21] The pragmatic maxim is: "Consider what effects, that might conceivably have practical bearings, we conceive the object of our conception to have. Then, our conception of these effects is the whole of our conception of the object." It is a method for fruitful clarification of conceptions by equating the meaning of a conception with the conceivable practical implications of its object's conceived effects. Peirce held that that is precisely tailored to abduction's purpose in inquiry, the forming of an idea that could conceivably shape informed conduct. In various writings in the 1900s[5][32] he said that the conduct of abduction (or retroduction) is governed by considerations of economy, belonging in particular to the economics of research. He regarded economics as a normative science whose analytic portion might be part of logical methodeutic (that is, theory of inquiry).[33]
Peirce came over the years to divide (philosophical) logic into three departments:
- Stechiology, or speculative grammar, on the conditions for meaningfulness. Classification of signs (semblances, symptoms, symbols, etc.) and their combinations (as well as their objects and interpretants).
- Logical critic, or logic proper, on validity or justifiability of inference, the conditions for true representation. Critique of arguments in their various modes (deduction, induction, abduction).
- Methodeutic, or speculative rhetoric, on the conditions for determination of interpretations. Methodology of inquiry in its interplay of modes.
Peirce had, from the start, seen the modes of inference as being coordinated together in scientific inquiry and, by the 1900s, held that hypothetical inference in particular is inadequately treated at the level of critique of arguments.[20][21] To increase the assurance of a hypothetical conclusion, one needs to deduce implications about evidence to be found, predictions which induction can test through observation so as to evaluate the hypothesis. That is Peirce's outline of the scientific method of inquiry, as covered in his inquiry methodology, which includes pragmatism or, as he later called it, pragmaticism, the clarification of ideas in terms of their conceivable implications regarding informed practice.
As early as 1866,[34] Peirce held that:
1. Hypothesis (abductive inference) is inference through an icon (also called a likeness).
2. Induction is inference through an index (a sign by factual connection); a sample is an index of the totality from which it is drawn.
3. Deduction is inference through a symbol (a sign by interpretive habit irrespective of resemblance or connection to its object).
In 1902, Peirce wrote that, in abduction: "It is recognized that the phenomena are like, i.e. constitute an Icon of, a replica of a general conception, or Symbol."[35]
At the critical level Peirce examined the forms of abductive arguments (as discussed above), and came to hold that the hypothesis should economize explanation for plausibility in terms of the feasible and natural. In 1908 Peirce described this plausibility in some detail.[16] It involves not likeliness based on observations (which is instead the inductive evaluation of a hypothesis), but instead optimal simplicity in the sense of the "facile and natural", as by Galileo's natural light of reason and as distinct from "logical simplicity" (Peirce does not dismiss logical simplicity entirely but sees it in a subordinate role; taken to its logical extreme it would favor adding no explanation to the observation at all). Even a well-prepared mind guesses oftener wrong than right, but our guesses succeed better than random luck at reaching the truth or at least advancing the inquiry, and that indicates to Peirce that they are based in instinctive attunement to nature, an affinity between the mind's processes and the processes of the real, which would account for why appealingly "natural" guesses are the ones that oftenest (or least seldom) succeed; to which Peirce added the argument that such guesses are to be preferred since, without "a natural bent like nature's", people would have no hope of understanding nature. In 1910 Peirce made a three-way distinction between probability, verisimilitude, and plausibility, and defined plausibility with a normative "ought": "By plausibility, I mean the degree to which a theory ought to recommend itself to our belief independently of any kind of evidence other than our instinct urging us to regard it favorably."[36] For Peirce, plausibility does not depend on observed frequencies or probabilities, or on verisimilitude, or even on testability, which is not a question of the critique of the hypothetical inference as an inference, but rather a question of the hypothesis's relation to the inquiry process.
The phrase "inference to the best explanation" (not used by Peirce but often applied to hypothetical inference) is not always understood as referring to the most simple and natural. However, in other senses of "best", such as "standing up best to tests", it is hard to know which is the best explanation to form, since one has not tested it yet. Still, for Peirce, any justification of an abductive inference as good is not completed upon its formation as an argument (unlike with induction and deduction) and instead depends also on its methodological role and promise (such as its testability) in advancing inquiry.[20][21][37]
At the methodeutical level Peirce held that a hypothesis is judged and selected[20] for testing because it offers, via its trial, to expedite and economize the inquiry process itself toward new truths, first of all by being testable and also by further economies,[5] in terms of cost, value, and relationships among guesses (hypotheses). Here, considerations such as probability, absent from the treatment of abduction at the critical level, come into play. For examples:
- Cost: A simple but low-odds guess, if low in cost to test for falsity, may belong first in line for testing, to get it out of the way. If surprisingly it stands up to tests, that is worth knowing early in the inquiry, which otherwise might have stayed long on a wrong though seemingly likelier track.
- Value: A guess is intrinsically worth testing if it has instinctual plausibility or reasoned objective probability, while subjective likelihood, though reasoned, can be treacherous.
- Interrelationships: Guesses can be chosen for trial strategically for their
- caution, for which Peirce gave as example the game of Twenty Questions,
- breadth of applicability to explain various phenomena, and
- incomplexity, that of a hypothesis that seems too simple but whose trial "may give a good 'leave,' as the billiard-players say", and be instructive for the pursuit of various and conflicting hypotheses that are less simple.[38]
Norwood Russell Hanson, a philosopher of science, wanted to grasp a logic explaining how scientific discoveries take place. He used Peirce's notion of abduction for this.[39]
Further development of the concept can be found in Peter Lipton's Inference to the Best Explanation (Lipton, 1991).
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.
Abduction can also be used to model automated planning.[40] 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.
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.
Belief revision, the process of adapting beliefs in view of new information, is another field in which abduction has been applied. The main problem of belief revision is that the new information may be inconsistent with the corpus of beliefs, while the result of the incorporation cannot be inconsistent. This process can be done by the use of abduction: once an explanation for the observation has been found, integrating it does not generate inconsistency. This use of abduction is not straightforward, as adding propositional formulae to other propositional formulae can only make inconsistencies worse. Instead, abduction is done at the level of the ordering of preference of the possible worlds. Preference models use fuzzy logic or utility models.
In the philosophy of science, abduction has been the key inference method to support scientific realism, and much of the debate about scientific realism is focused on whether abduction is an acceptable method of inference.
In historical linguistics, abduction during language acquisition is often taken to be an essential part of processes of language change such as reanalysis and analogy.[41]
In anthropology, Alfred Gell in his influential book Art and Agency defined abduction, (after Eco[42]) as “a case of synthetic inference 'where we find some very curious circumstances, which would be explained by the supposition that it was a case of some general rule, and thereupon adopt that supposition”.[43] Gell criticizes existing 'anthropological' studies of art, for being too preoccupied with aesthetic value and not preoccupied enough with the central anthropological concern of uncovering 'social relationships' specifically the social contexts in which artworks are produced, circulated, and received.[44] Abduction is used as the basis of one gets from art to agency in the sense of a theory of how works of art can inspire a sensus communis, or the commonly-held views that a characteristic of a given society because they are shared by everyone in that society.[45] The question Gell asks in the book is, ‘how does it initially ‘speak’ to people?’ He answers by saying that “No reasonable person could suppose that art-like relations between people and things do not involve at least some form of semiosis.”[43] However, he rejects any intimation that semiosis can be thought of as a language because then he would have to admit to some pre-established existence of the sensus communis that he wants to claim only emerges afterwards out of art. Abduction is the answer to this conundrum because the tentative nature of the abduction concept (Peirce likened it to guessing) means that not only can it operate outside of any pre-existing framework, but moreover, it can actually intimate the existence of a framework. As Gell reasons in his analysis, the physical existence of the artwork prompts the viewer to perform an abduction that imbues the artwork with intentionality. A statue of a goddess, for example, in some senses actually becomes the goddess in the mind of the beholder; and represents not only the form of the deity but also her intentions (which are adduced from the feeling of her very presence). Therefore through abduction, Gell claims that art can have the kind of agency that plants the seeds that grow into cultural myths. The power of agency is the power to motivate actions and inspire ultimately the shared understanding that characterizes any given society.[45]
- This article is based on material taken from the Free On-line Dictionary of Computing prior to 1 November 2008 and incorporated under the "relicensing" terms of the GFDL, version 1.3 or later.
- Awbrey, Jon, and Awbrey, Susan (1995), "Interpretation as Action: The Risk of Inquiry", Inquiry: Critical Thinking Across the Disciplines, 15, 40-52. Eprint
- Cialdea Mayer, Marta and Pirri, Fiora (1993) "First order abduction via tableau and sequent calculi" Logic Jnl IGPL 1993 1: 99-117; doi:10.1093/jigpal/1.1.99.Oxford Journals
- Cialdea Mayer, Marta and Pirri, Fiora (1995) "Propositional Abduction in Modal Logic", Logic Jnl IGPL 1995 3: 907-919; doi:10.1093/jigpal/3.6.907 Oxford Journals
- Edwards, Paul (1967, eds.), "The Encyclopedia of Philosophy," Macmillan Publishing Co, Inc. & The Free Press, New York. Collier Macmillan Publishers, London.
- Eiter, T., and Gottlob, G. (1995), "The Complexity of Logic-Based Abduction, Journal of the ACM, 42.1, 3-42.
- Harman, Gilbert (1965). "The Inference to the Best Explanation," The Philosophical Review 74:1, 88-95.
- Josephson, John R., and Josephson, Susan G. (1995, eds.), Abductive Inference: Computation, Philosophy, Technology, Cambridge University Press, Cambridge, UK.
- Lipton, Peter. (2001). Inference to the Best Explanation, London: Routledge. ISBN 0-415-24202-9.
- McKaughan, Daniel J. (2008), "From Ugly Duckling to Swan: C. S. Peirce, Abduction, and the Pursuit of Scientific Theories", Transactions of the Charles S. Peirce Society, v. 44, no. 3 (summer), 446–468. Abstract.
- Menzies, T. (1996), "Applications of Abduction: Knowledge-Level Modeling, International Journal of Human-Computer Studies, 45.3, 305-335.
- Santaella, Lucia (1997) "The Development of Peirce's Three Types of Reasoning: Abduction, Deduction, and Induction", 6th Congress of the IASS. Eprint.
- Sebeok, T. (1981) "You Know My Method." In Sebeok, T. "The Play of Musement." Indiana. Bloomington, IA.
- Yu, Chong Ho (1994), "Is There a Logic of Exploratory Data Analysis?", Annual Meeting of American Educational Research Association, New Orleans, LA, April, 1994. Website of Dr. Chong Ho (Alex) Yu
- ^
- Magnani, L. "Abduction, Reason, and Science: Processes of Discovery and Explanation". Kluwer Academic Plenum Publishers, New York, 2001. xvii þ 205 pages. Hard cover, ISBN 0-306-46514-0.
- R. Josephson, J. & G. Josephson, S. "Abductive Inference: Computation, Philosophy, Technology" Cambridge University Press, New York & Cambridge (U.K.). viii þ 306 pages. Hard cover (1994), ISBN 0-521-43461-0, Paperback (1996), ISBN 0-521-57545-1.
- Bunt, H. & Black, W. "Abduction, Belief and Context in Dialogue: Studies in Computational Pragmatics" (Natural Language Processing, 1.) John Benjamins, Amsterdam & Philadelphia, 2000. vi þ 471 pages. Hard cover, ISBN 90-272-4983-0 (Europe),
1-58619-794-2 (U.S.)
- ^ a b Peirce, C. S.
- "On the Logic of drawing History from Ancient Documents especially from Testimonies" (1901), Collected Papers v. 7, paragraph 219.
- "PAP" ["Prolegomena to an Apology for Pragmatism"], MS 293 c. 1906, New Elements of Mathematics v. 4, pp. 319-320.
- A Letter to F. A. Woods (1913), Collected Papers v. 8, paragraphs 385-388.
(See under "Abduction" and "Retroduction" at Commens Dictionary of Peirce's Terms.
- ^ a b c d e Peirce, C. S. (1903), Harvard lectures on pragmatism, Collected Papers v. 5, paragraphs 188–189.
- ^ a b c A Letter to J. H. Kehler (1911), New Elements of Mathemaatics v. 3, pp. 203–4, see under "Retroduction" at Commens Dictionary of Peirce's Terms.
- ^ a b c d Peirce, C.S. (1902), application to the Carnegie Institution, see MS L75.329-330, from Draft D of Memoir 27:
Consequently, to discover is simply to expedite an event that would occur sooner or later, if we had not troubled ourselves to make the discovery. Consequently, the art of discovery is purely a question of economics. The economics of research is, so far as logic is concerned, the leading doctrine with reference to the art of discovery. Consequently, the conduct of abduction, which is chiefly a question of heuretic and is the first question of heuretic, is to be governed by economical considerations.
- ^ See, e.g. Analysis of Evidence, 2d ed. by Terence Anderson (Cambridge University Press, 2005)
- ^ For examples, see "Abductive Inference in Reasoning and Perception", John R. Josephson, Laboratory for Artificial Intelligence Research, Ohio State University, and Abduction, Reason, and Science. Processes of Discovery and Explanation by Lorenzo Magnani (Kluwer Academic/Plenum Publishers, New York, 2001).
- ^ Peirce Ms. 692, quoted in Sebeok, T. (1981) "You Know My Method." In Sebeok, T. "The Play of Musement." Bloomington, IA: Indiana. P 24
- ^ Peirce Ms. 696, quoted in Sebeok, T. (1981) "You Know My Method." In Sebeok, T. "The Play of Musement." Bloomington, IA: Indiana. P 31
- ^ Jonathan Koehler. The Base Rate Fallacy Reconsidered: Descriptive, Normative and Methodological Challenges. Behavioral and Brain Sciences. 19, 1996.
- ^ Robertson, B., & Vignaux, G. A. (1995). Interpreting evidence: Evaluating forensic evidence in the courtroom. Chichester: John Wiley and Sons.
- ^ a b c A. Jøsang. Conditional Reasoning with Subjective Logic. Journal of multiple valued logic and soft computing. 15(1), pp.5-38, 2008.PDF
- ^ Popper, Karl (2002), Conjectures and Refutations: The Growth of Scientific Knowledge, London, UK: Routledge. p 536
- ^ See Santaella, Lucia (1997) "The Development of Peirce's Three Types of Reasoning: Abduction, Deduction, and Induction", 6th Congress of the IASS. Eprint.
- ^ Peirce, C. S. (1908), "A Neglected Argument for the Reality of God", Hibbert Journal v. 7, pp. 90–112, see §4. In Collected Papers v. 6, see paragraph 476. In The Essential Peirce v. 2, see p. 444.
- ^ a b c d Peirce, C. S. (1908), "A Neglected Argument for the Reality of God", Hibbert Journal v. 7, pp. 90–112. See both part III and part IV. Reprinted, including originally unpublished portion, in Collected Papers v. 6, paragraphs 452–85, Essential Peirce v. 2, pp. 434–50, and elsewhere.
- ^ Peirce used the term "intuition" not in the sense of an instinctive or anyway half-conscious inference as people often do currently. Instead he used "intuition" usually in the sense of a cognition devoid of logical determination by previous cognitions. He said, "We have no power of Intuition" in that sense. See his "Some Consequences of Four Incapacities" (1868), Eprint.
- ^ For a relevant discussion of Peirce and the aims of abductive inference, see McKaughan, Daniel J. (2008), "From Ugly Duckling to Swan: C. S. Peirce, Abduction, and the Pursuit of Scientific Theories", Transactions of the Charles S. Peirce Society, v. 44, no. 3 (summer), 446–468.
- ^ Peirce means "conceivable" very broadly. See Collected Papers v. 5, paragraph 196, or Essential Peirce v. 2, p. 235, "Pragmatism as the Logic of Abduction" (Lecture VII of the 1903 Harvard lectures on pragmatism):
It allows any flight of imagination, provided this imagination ultimately alights upon a possible practical effect; and thus many hypotheses may seem at first glance to be excluded by the pragmatical maxim that are not really so excluded.
- ^ a b c d Peirce, C. S., Carnegie Application (L75, 1902, New Elements of Mathematics v. 4, pp. 37–38. See under "Abduction" at the Commens Dictionary of Peirce's Terms:
Methodeutic has a special interest in Abduction, or the inference which starts a scientific hypothesis. For it is not sufficient that a hypothesis should be a justifiable one. Any hypothesis which explains the facts is justified critically. But among justifiable hypotheses we have to select that one which is suitable for being tested by experiment.
- ^ a b c d Peirce, "Pragmatism as the Logic of Abduction" (Lecture VII of the 1903 Harvard lectures on pragmatism), see parts III and IV. Published in part in Collected Papers v. 5, paragraphs 180–212 (see 196–200, Eprint and in full in Essential Peirce v. 2, pp. 226–241 (see sections III and IV).
.... What is good abduction? What should an explanatory hypothesis be to be worthy to rank as a hypothesis? Of course, it must explain the facts. But what other conditions ought it to fulfill to be good? .... Any hypothesis, therefore, may be admissible, in the absence of any special reasons to the contrary, provided it be capable of experimental verification, and only insofar as it is capable of such verification. This is approximately the doctrine of pragmatism.
- ^ Peirce, A Letter to Paul Carus circa 1910, Collected Papers v. 8, paragraphs 227–228. See under "Hypothesis" at the Commens Dictionary of Peirce's Terms.
- ^ a b (1867), "On the Natural Classification of Arguments", Proceedings of the American Academy of Arts and Sciences v. 7, pp. 261–287. Presented April 9, 1867. See especially starting at p. 284 in Part III §1. Reprinted in Collected Papers v. 2, paragraphs 461–516 and Writings v. 2, pp. 23–49.
- ^ a b c Peirce, C. S. (1878), "Deduction, Induction, and Hypothesis", Popular Science Monthly, v. 13, pp. 470–82, see 472. Collected Papers 2.619–44, see 623.
- ^ a b A letter to Langley, 1900, published in Historical Perspectives on Peirce's Logic of Science. See excerpts under "Abduction" at the Commens Dictionary of Peirce's Terms.
- ^ "A Syllabus of Certain Topics of Logic'" (1903 manuscript), Essential Peirce v. 2, see p. 287. See under "Abduction" at the Commens Dictionary of Peirce's Terms.
- ^ Peirce, C. S., "On the Logic of Drawing History from Ancient Documents", dated as circa 1901 both by the editors of Collected Papers (see CP v. 7, bk 2, ch. 3, footnote 1) and by those of the Essential Peirce (EP) (Eprint. The article's discussion of abduction is in CP v. 7, paragraphs 218–31 and in EP v. 2, pp. 107–14.
- ^ a b Peirce, C. S., "A Syllabus of Certain Topics of Logic" (1903), Essential Peirce v. 2, p. 287:
The mind seeks to bring the facts, as modified by the new discovery, into order; that is, to form a general conception embracing them. In some cases, it does this by an act of generalization. In other cases, no new law is suggested, but only a peculiar state of facts that will "explain" the surprising phenomenon; and a law already known is recognized as applicable to the suggested hypothesis, so that the phenomenon, under that assumption, would not be surprising, but quite likely, or even would be a necessary result. This synthesis suggesting a new conception or hypothesis, is the Abduction.
- ^ Peirce, C. S. (1883), "A Theory of Probable Inference" in Studies in Logic).
- ^ In Peirce, C. S., 'Minute Logic' circa 1902, Collected Papers v. 2, paragraph 102. See under "Abduction" at Commens Dictionary of Peirce's Terms.
- ^ Peirce, "On the Logic of drawing History from Ancient Documents", 1901 manuscript, Collected Papers v. 7, paragraphs 164–231, see 202, reprinted in Essential Peirce v. 2, pp. 75–114, see 95. See under "Abduction" at Commens Dictionary of Peirce's Terms.
- ^ Peirce, "On the Logic of Drawing Ancient History from Documents", Essential Peirce v. 2, see pp. 107–9.
- ^ Peirce, Carnegie application, L75 (1902), Memoir 28: "On the Economics of Research", scroll down to Draft E. Eprint.
- ^ Peirce, C. S., the 1866 Lowell Lectures on the Logic of Science, Writings of Charles S. Peirce v. 1, p. 485. See under "Hypothesis" at Commens Dictionary of Peirce's Terms.
- ^ Peirce, C. S., "A Syllabus of Certain Topics of Logic", written 1903. See The Essential Peirce v. 2, p. 287. Quote viewable under "Abduction" at Commens Dictionary of Peirce's Terms.
- ^ Peirce, A Letter to Paul Carus 1910, Collected Papers v. 8, see paragraph 223.
- ^ Peirce, C. S. (1902), Application to the Carnegie Institution, Memoir 27, Eprint: "Of the different classes of arguments, abductions are the only ones in which after they have been admitted to be just, it still remains to inquire whether they are advantageous."
- ^ Peirce, "On the Logic of Drawing Ancient History from Documents", Essential Peirce v. 2, see pp. 107–9 and 113. On Twenty Questions, p. 109, Peirce has pointed out that if each question eliminates half the possibilities, twenty questions can choose from among 220 or 1,048,576 objects, and goes on to say:
Thus, twenty skillful hypotheses will ascertain what 200,000 stupid ones might fail to do. The secret of the business lies in the caution which breaks a hypothesis up into its smallest logical components, and only risks one of them at a time.
- ^ Schwendtner, Tibor and Ropolyi, László and Kiss, Olga (eds): Hermeneutika és a természettudományok. Áron Kiadó, Budapest, 2001. It is written in Hungarian. Meaning of the title: Hermeneutics and the natural sciences.
- ^ Kave Eshghi. Abductive planning with the event calculus. In Robert A. Kowalski, Kenneth A. Bowen editors: Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15–19, 1988. MIT Press 1988, ISBN 0-262-61056-6
- ^ April M. S. McMahon (1994): Understanding language change. Cambridge: Cambridge University Press. ISBN 0-521-44665-1
- ^ Eco, U. (1976). "A theory of Semiotics." Bloomington, IA: Indiana. p 131
- ^ a b Gell, A. 1984, Art and Agency. Oxford: Oxford. p 14
- ^ Bowden, R. (2004) A critique of Alfred Gell on Art and Agency. Retrieved Sept 2007 from: Find Articles at BNET
- ^ a b Whitney D. (2006) ‘Abduction the agency of art.’ Retrieved May 2009 from: University of California, Berkeley
- Abduction entry by Igor Douven in the Stanford Encyclopedia of Philosophy
- "Abductive Inference" (once there, scroll down), John R. Josephson, Laboratory for Artificial Intelligence Research, Ohio State University. (Former webpage via the Wayback Machine.)
- "Deduction, Induction, and Abduction", Chapter 3 in article "Charles Sanders Peirce" by Robert Burch, 2001 and 2006, in the Stanford Encyclopedia of Philosophy.
- "Abduction", links to articles and websites on abductive inference, Martin Ryder.
- International Research Group on Abductive Inference, Uwe Wirth and Alexander Roesler, eds. Uses frames. Click on link at bottom of its home page for English. Wirth moved to U. of Gießen, Germany, and set up Abduktionsforschung, home page not in English but see Artikel section there. Abduktionsforschung home page via Google translation.
- "'You Know My Method': A Juxtaposition of Charles S. Peirce and Sherlock Holmes" (1981), by Thomas Sebeok with Jean Umiker-Sebeok, from The Play of Musement, Thomas Sebeok, Bloomington, Indiana: Indiana University Press, pp. 17–52.
- Commens Dictionary of Peirce's Terms, Mats Bergman and Sami Paavola, editors, Helsinki U. Peirce's own definitions, often many per term across the decades. There, see "Hypothesis [as a form of reasoning]", "Abduction", "Retroduction", and "Presumption [as a form of reasoning]".
|
|
|
|
Overview
|
|
Academic
areas |
|
|
Foundational
concepts |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
