Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

ABDUCTIVE REASONINGABDUCTION AS COMPUTATION

ABDUCTIVE REASONING: ABDUCTION AS COMPUTATION [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.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

ABDUCTIVE REASONINGABDUCTION AS COMPUTATION

Part of the Synthese Library Book Series (volume 330)
ALISEDA, ATOCHA
ABDUCTIVE REASONING — Jan 1, 2006
Download PDF
37 pages

Loading next page...
 
/lp/springer-journals/abductive-reasoning-abduction-as-computation-ua4hVwLJwh

References (0)

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Springer Netherlands
Copyright
© Springer 2006
ISBN
978-1-4020-3906-5
Pages
95 –132
DOI
10.1007/1-4020-3907-7_4
Publisher site
See Chapter on Publisher Site

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.]

Published: Jan 1, 2006

Keywords: Logic Programming; Abductive Reasoning; Open Branch; Closed Extension; Conjunctive Form

There are no references for this article.