The Computational Complexity of Abduction

@article{Bylander1991TheCC,
  title={The Computational Complexity of Abduction},
  author={Tom Bylander and Dean Allemang and Michael C. Tanner and John R. Josephson},
  journal={Artif. Intell.},
  year={1991},
  volume={49},
  pages={25-60}
}
The problem of abduction can be characterized as nding the best explanation of a set of data. In this paper we focus on one type of abduction in which the best explanation is the most plausible combination of hypotheses that explains all the data. We then present several computational complexity results demonstrating that this type of abduction is intractable (NP-hard) in general. In particular, choosing between incompatible hypotheses, reasoning about cancellation eeects among hypotheses, and… CONTINUE READING
Highly Influential
This paper has highly influenced 27 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 203 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 32 references

Concurrent synthesis of composite ex- planatory hypotheses

  • A. Goel, P. Sadayappan, J. R. Josephson
  • Proc. Seventeeth Int. Conf. on Parallel…
  • 1988
Highly Influential
5 Excerpts

A theory of diagnosis from rst principles

  • R. Reiter
  • Arti cial Intelligence, 32(1):57{95,
  • 1987
Highly Influential
15 Excerpts

Practical abduction

  • J. R. Josephson, A. Goel
  • Technical report, Lab. for AI Research, CIS Dept…
  • 1990
1 Excerpt

Similar Papers

Loading similar papers…