Abstract
Our logical analysis of abduction in the previous chapter is in a sense, purely structural. It was possible to state how abductive explanatory logic behaves, but not how abductive explanations are generated. In this chapter we turn to the question of abduction as a computational process. There are several frameworks for computing abductions; two of which are logic programming and semantic tableaux. The former is a popular one, and it has opened a whole field of abductive logic programming [KKT95] and [FK00]. The latter has also been proposed for handling abduction [MP93] and [AN04], and it is our preference here. Semantic tableaux are a well-motivated standard logical framework. But over these structures, different search strategies can compute several versions of abduction with the non-standard behaviour that we observed in the preceding chapter. Moreover, we can naturally compute various kinds of abducibles: atoms, conjunctions or even conditionals. This goes beyond the framework of abductive logic programming, in which abducibles are atoms from a special set of abducibles.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this chapter
Cite this chapter
ALISEDA, A. (2006). ABDUCTION AS COMPUTATION. In: ABDUCTIVE REASONING. Synthese Library, vol 330. Springer, Dordrecht. https://doi.org/10.1007/1-4020-3907-7_4
Download citation
DOI: https://doi.org/10.1007/1-4020-3907-7_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-3906-5
Online ISBN: 978-1-4020-3907-2
eBook Packages: Humanities, Social Sciences and LawPhilosophy and Religion (R0)