A logic of diagnosis proceeds in terms of a set of data and one or more (prioritized) sets of expectancies. In this paper we generalize the logics of diagnosis from [27] and present some alternatives. The former operate on the premises and expectancies themselves, the latter on their consequences.

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. (shrink)

In this article I will show how the goal-directed proof procedure for the propositional fragment of the 'inconsistency-adaptive' logic CLuN(r)from Batens (2005, J. Appl. Logic, 3, 221-250) called pCLuN(r) allows for generating sensible abductive explanations from finite inconsistent theories. Before this is shown, I give a more general account on how goal-directed proof procedures contribute to the study of abduction as backward reasoning. Between these two parts, I describe the goal-directed proof procedure for the propositional fragment of the 'inconsistency-adaptive' logic (...) CLuNr from Batens (2005, J. Appl. Logic, 3, 221-250). (shrink)

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. (shrink)

In this paper, we present the outline for a goal-directed proof procedure for abductive reasoning and compare this procedure with Aliseda’s approach.