Dean Allemang, Michael Tanner, Tom Bylander, and John Josephson. Computational complexity of hypothesis assembly . In the following, we will describe each of them. Since hypotheses are constructed using a set of previously known candidates, this approach is also called hypothesis assembly. Computational complexity of hypothesis assembly .
Abductive inference is inference to the best abductive explanation.
They differ both is their definition of what constitutes an abductive explanation and consequently what constitutes a best explanation. This will be discussed in further detail in the section on computational complexity. Consequently, the abductive framework is defined using diagnostic terminology. D. Allemang, M. Tanner, T. Bylander, and J. Josephson. On the computational complexity of hypothesis assembly .