Abduction through Semantic Tableaux versus Abduction through Goal-Directed Proofs

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

Full description

Saved in:
Bibliographic Details
Published in:Theoria (Madrid, Spain) Spain), 2007-09, Vol.22 (3(60)), p.295-304
Main Authors: Meheus, Joke, Provijn, Dagmar
Format: Article
Language:English
Subjects:
Abductive reasoning
Algorithms
Forum: on Atocha Aliseda's "Abductive Reasoning"
Heuristics
History of science and technology
Jokes
Logic
Logic and calculus
Logical proofs
Mathematical procedures
Mathematical sciences and techniques
Philosophy of science
Semantic tableaux
Tableaux
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0495-4548
2171-679X