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.