Abduction through semantic tableaux versus abduction through goal-directed proofs

Theoria 22 (3):295-304 (2007)

Authors
Joke Meheus
University of Ghent
Abstract
In this paper, we present a goal-directed proof procedure for abductive reasoning. This procedure will be compared with Aliseda’s approach based on semantic tableaux. We begin with some comments on Aliseda’s algorithms for computing conjunctive abductions and show that they do not entirely live up to their aims. Next we give a concise account of goal-directed proofs and we show that abductive explanations are a natural spin-off of these proofs. Finally, we show that the goal-directed procedure solves the problems we encountered in Aliseda’s algorithms
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI theoria200722326
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 40,164
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Abductive Logics in a Belief Revision Framework.Bernard Walliser, Denis Zwirn & Hervé Zwirn - 2005 - Journal of Logic, Language and Information 14 (1):87-117.
Advice on Abductive Logic.Dov Gabbay & John Woods - 2006 - Logic Journal of the IGPL 14 (2):189-219.
Wants and Lacks.Gareth B. Matthews & S. Marc Cohen - 1967 - Journal of Philosophy 64 (14):455-456.
Lacunae, Empirical Progress and Semantic Tableaux.Atocha Aliseda - 2005 - Poznan Studies in the Philosophy of the Sciences and the Humanities 83 (1):169-189.

Analytics

Added to PP index
2009-01-28

Total views
106 ( #69,196 of 2,237,278 )

Recent downloads (6 months)
34 ( #18,633 of 2,237,278 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature