Add to ORKGABSTRACT: 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 Alis-eda’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
Most logic–based approaches characterize abduction as a kind of backwards deduction plus additional ...
Traditional abduction imposes as a precondition the restriction that the background information may ...
The purpose of this piece is to provide a critical analysis on some key aspects of abduction, as con...
In this paper, we present the outline for a goal-directed proof procedure for abductive reasoning an...
In this paper, we present a goal-directed proof procedure for abductive reasoning. This procedure wi...
The formalization of abductive reasoning is still an open question: there is no general agreement on...
The formalization of abductive reasoning is still an open question: there is no general agreement on...
Abstract. The aim o/ this paper is to propose a way to extend the framework o/ semantic tableaux in ...
Abstract. Abduction is reasoning in propositional or first-order logic that provides explanations fo...
We argue for the usefulness of abductive reasoning in the context of ontologies. We discuss several...
A long outstanding problem for abduction in logic programming has been on how minimality might be de...
In this paper, we propose a reconstruction of logic-based approaches to abductive reasoning in terms...
I will analyse some properties of abduction that are essential from a logical standpoint. When deali...
Summary. Most logic–based approaches characterize abduction as a kind of back-wards deduction plus a...
AbstractA long outstanding problem for abduction in logic programming has been on how minimality mig...
Most logic–based approaches characterize abduction as a kind of backwards deduction plus additional ...
Traditional abduction imposes as a precondition the restriction that the background information may ...
The purpose of this piece is to provide a critical analysis on some key aspects of abduction, as con...
In this paper, we present the outline for a goal-directed proof procedure for abductive reasoning an...
In this paper, we present a goal-directed proof procedure for abductive reasoning. This procedure wi...
The formalization of abductive reasoning is still an open question: there is no general agreement on...
The formalization of abductive reasoning is still an open question: there is no general agreement on...
Abstract. The aim o/ this paper is to propose a way to extend the framework o/ semantic tableaux in ...
Abstract. Abduction is reasoning in propositional or first-order logic that provides explanations fo...
We argue for the usefulness of abductive reasoning in the context of ontologies. We discuss several...
A long outstanding problem for abduction in logic programming has been on how minimality might be de...
In this paper, we propose a reconstruction of logic-based approaches to abductive reasoning in terms...
I will analyse some properties of abduction that are essential from a logical standpoint. When deali...
Summary. Most logic–based approaches characterize abduction as a kind of back-wards deduction plus a...
AbstractA long outstanding problem for abduction in logic programming has been on how minimality mig...
Most logic–based approaches characterize abduction as a kind of backwards deduction plus additional ...
Traditional abduction imposes as a precondition the restriction that the background information may ...
The purpose of this piece is to provide a critical analysis on some key aspects of abduction, as con...