## Abduction in Logic Programming

### Cached

### Download Links

- [www.cs.kuleuven.ac.be]
- [www.cs.kuleuven.be]
- [www.math-info.univ-paris5.fr]
- [www.stanford.edu]
- [www.stanford.edu]
- [www.cs.kuleuven.ac.be]
- [www-lp.doc.ic.ac.uk]
- [www.disi.unige.it]
- [www-lp.doc.ic.ac.uk]
- [www-lp.doc.ic.ac.uk]
- [www.math-info.univ-paris5.fr]
- [www.cs.ucy.ac.cy]
- [www.cs.ucy.ac.cy]
- [www2.cs.ucy.ac.cy]
- [www.cs.ucy.ac.cy]
- [www2.cs.ucy.ac.cy]
- DBLP

### Other Repositories/Bibliography

Citations: | 547 - 74 self |

### BibTeX

@MISC{Denecker_abductionin,

author = {Marc Denecker and Antonis Kakas},

title = {Abduction in Logic Programming},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over the last ten years and to take a critical view of these developments from several perspectives: logical, epistemological, computational and suitability to application. The paper attempts to expose some of the challenges and prospects for the further development of the field.

### Citations

977 |
Negation as failure
- Clark
- 1978
(Show Context)
Citation Context ...is that of [10]. The syntax in this framework is that of hierarchical logic programs 7 with a predefined set of abducible predicates. The formal syntax is an extension of Clark’s completion semantics =-=[9]-=- in which onlythe non-abducible predicates are completed. The main aim of this work was to studythe relationship between abduction and deduction in the setting of non-monotonic reasoning. In particula... |

652 |
A truth maintenance system
- Doyle
- 1979
(Show Context)
Citation Context ...70] present a method for computing generalised stable models for logic programs with integrity constraints represented as denials. The method is a bottomup computation based upon the TMS procedure of =-=[36]-=-. Although the computation is not goal-directed, goals (or queries) can be represented as denials and be treated as integrity constraints. Compared with other bottom-up procedures for computing genera... |

458 | Concurrent Constraint Programming - Saraswat - 1993 |

213 | Preferred Subtheories: An Extended Logical Framework for Default Reasoning
- Brewka
- 1989
(Show Context)
Citation Context ...f query evaluation. Moreover various (domain speci c) criteria of preference can be speci ed. They impose a (partial) order on the sets of hypotheses which leads to the discrimination of explanations =-=[13, 22, 61, 77, 143, 148, 180]-=-. Cox and Pietrzykowski [29] identify other desirable properties of abductive explanations. For instance, an explanation should be basic, i.e. should not be explainable in terms of 4other explanation... |

206 |
A.: Abduction Compared with Negation by Failure
- Eshghi, Kowalski
- 1989
(Show Context)
Citation Context ... of abduction has been demonstrated in a varietyof applications. It has been proposed as a reasoning paradigm in AI for diagnosis [8,90], natural language understanding [8,39,4,93], default reasoning =-=[81,29,25,50]-=-, planning [28,110,71,59], knowledge assimilation and belief revision [54,76], multiagent systems [7,64,102] and other problems. In the context of logic programming, the studyof abductive inference st... |

176 |
Acyclic programs
- Apt, Bezem
- 1990
(Show Context)
Citation Context ...on-minimal explanation fq� rg are computed for the observation p. The abductive task for the logic-based approach has been proved to be highly intractable: it is NP-hard even if T is a set of acyclic =-=[7]-=- propositional de nite clauses [174, 48], and is even harder if T is a set of any propositional clauses [48]. These complexity results hold even if explanations are not required to be minimal. However... |

168 | On the relationship between abduction and deduction
- Console, Dupré, et al.
- 1991
(Show Context)
Citation Context ...d Mancarella showed the application of abduction in logic programming for deductive database updating and knowledge assimilation [53,55]. The application of abduction to diagnosis has been studied in =-=[10,11]-=- A.C. Kakas, F. Sadri (Eds.): Computat. Logic (Kowalski Festschrift), LNAI 2407, pp. 402–436, 2002. c○ Springer-Verlag Berlin Heidelberg 2002Abduction in Logic Programming 403 within an abductive log... |

131 | Constructive negation based on the completed database - Chan - 1988 |

131 |
Memoing for logic programs
- Warren
- 1992
(Show Context)
Citation Context ...�:::�Ln is called the body of the clause. A logic program where each literal Li in the body of every clause is atomic is said to be de nite. Abduction can be computed in LP by extending SLD and SLDNF =-=[23, 53, 54, 91, 94, 34, 181]-=-. Instead of failing in a proof when a selected subgoal fails to unify with the head of any rule, the subgoal can be viewed as a hypothesis. This is similar to viewing abducibles as \askable" conditio... |

131 | Human reasoning - Evans, Newstead, et al. - 1993 |

116 |
Abductive planning with event calculus
- Eshghi
- 1988
(Show Context)
Citation Context ...emonstrated in a varietyof applications. It has been proposed as a reasoning paradigm in AI for diagnosis [8,90], natural language understanding [8,39,4,93], default reasoning [81,29,25,50], planning =-=[28,110,71,59]-=-, knowledge assimilation and belief revision [54,76], multiagent systems [7,64,102] and other problems. In the context of logic programming, the studyof abductive inference started at the end of the e... |

72 |
Causes for events: Their computation and applications
- Cox, Pietrzykowski
- 1986
(Show Context)
Citation Context ...riteria of preference can be speci ed. They impose a (partial) order on the sets of hypotheses which leads to the discrimination of explanations [13, 22, 61, 77, 143, 148, 180]. Cox and Pietrzykowski =-=[29]-=- identify other desirable properties of abductive explanations. For instance, an explanation should be basic, i.e. should not be explainable in terms of 4other explanations. For instance, in example ... |

65 | SLDNFA: an abductive procedure for normal abductive programs
- Denecker, Schreye
- 1998
(Show Context)
Citation Context ...dure of [29] for computing negation as failure through abduction was extended to the case of general abductive predicates. Another earlyabductive procedure was developed in [10] using the completion. =-=[17]-=- proposed SLDNFA, an extension of SLDNF with abduction allowing nonground abductive hypotheses. [21] proposed an extension of SLDNFA with a constraint solver for linear order and demonstrated that thi... |

65 | Intensional updates: Abduction via deduction - Bry - 1990 |

63 | Temporal reasoning with abductive event calculus
- Denecker, Missiaen, et al.
- 1992
(Show Context)
Citation Context ...ion solves a planning goal by explaining it byan ordered sets of events -a plan- that entails the planning goal. This approach was further explored byShanahan [110], Missiaen et al. [72,71], Denecker =-=[21]-=-, Jung [48] and recentlyin [59,60]. Kakas and Mancarella showed the application of abduction in logic programming for deductive database updating and knowledge assimilation [53,55]. The application of... |

48 | A rational reconstruction of nonmonotonic truth maintenance systems - Elkan - 1990 |

47 | A theory of diagnosis for incomplete causal models - Console, Dupré, et al. - 1989 |

42 |
Integrity enforcement on deductive databases
- Decker
- 1987
(Show Context)
Citation Context ...hecking problem. Although the di erent views of integrity satisfaction are conceptually very di erent, the integrity checking procedures based upon these views are not very di erent in practice (e.g. =-=[30, 165, 118]-=-). They are mainly concerned with avoiding the ine ciency which arises if all the integrity constraints are retested after each update. A common idea of all these procedures is to render integritychec... |

37 | A transformation approach to negation in logic programming - Barbuti, Mancarella, et al. - 1990 |

33 |
Negation as hypothesis: an abductive foundation for logic programming
- Dung
- 1991
(Show Context)
Citation Context ...ons more generally within logic programming with other abducibles and integrity constraints (see section 5). In this section we will refer to the version of the abductive proof procedure presented in =-=[39]-=-. 9 The abductive proof procedure interleaves two types of computation. The rst type, referred to as the abductive phase, is standard SLD- resolution, which generates (negative) hypotheses and adds th... |

33 | A model generation theorem prover in KL1 using a rami algorithm - Fujita, Hasegawa |

26 | Residue: a deductive approach to design synthesis - Finger - 1985 |

23 |
Generalised stable models: a semantics for abduction
- Kakas, Mancarella
- 1990
(Show Context)
Citation Context ...cs was defined bya suitable extension of the completion semantics of LP. In parallel to these studies of abduction as an inferential method, Eshghi and Kowalski [29] and later Kakas and Mancarella in =-=[52,54]-=- and Dung in [25], used abduction as a semantical device to describe the non-monotonic semantics of Logic Programming (in a wayanalogous to Poole in [81]). In [18,14], abductive logic programming was ... |

23 | Rational belief revision
- Doyle
- 1991
(Show Context)
Citation Context ...raints. However, only the rst update satis es the integrity constraints if we are given the further update insert mother(sue� bob): The general problem of belief revision has been studied formally in =-=[65, 128, 129, 37]-=-. Gardenfors proposes a set of axioms for rational belief revision containing such constraints on the new theory as \no change should occur to the theory when trying to delete a fact that is not alrea... |

23 |
Well-founded reasoning with classical negation
- Dung, Ruamviboonsuk
- 1991
(Show Context)
Citation Context ...ple above wecan restore consistency by rejecting the NAF assumption bird(tom) even though bird(tom) does not hold. We then get the consistent setfbat(tom)� fly(tom)g. This problem has been studied in =-=[46]-=- and [137]. Both of these studies are primarily concerned with the related problem of inconsistency of the well-founded semantics when applied to extended logic programs [153]. To deal with the proble... |

17 | Abduction through deduction - Eshgi, Kowalski - 1988 |

15 | Computational complexity of hypothesis assembly - Allemang, Tanner, et al. - 1987 |

13 | Ports for objects - Janson, Montelius, et al. - 1993 |

13 |
On the duality of abduction and model generation
- Denecker, Schreye
- 1992
(Show Context)
Citation Context ...be a consequence of CET. The explanation formula is unique up to equivalence with respect to CET. The proof procedure is extended to take into account the equality theory CET. Denecker and De Schreye =-=[33]-=- compare the search space obtained by reasoning backward using the if-half of the if-and-only-if form of a de nite program with that obtained by reasoning forward using the only-if-half. They show ane... |

13 |
Acyclic disjunctive logic programs with abductive procedure as proof procedure
- Dung
- 1992
(Show Context)
Citation Context ...2 = fc� b� b0g and M0 3 = fc� a� a0�b�b0g,suchthat, if HB is the Herbrand base of PD, M0 i \ HB = Mi, for each i =1�2� 3. 44Whereas the transformation of [167] deals with inclusive disjunction, Dung =-=[41]-=- presents a simpler transformation that deals with exclusive disjunction, but works only for the case of acyclic programs. For example, the clause p _ q can be replaced by the two clauses p q q p: Wit... |

11 | Bottom-up Abduction by Model Generation
- Inoue, Ohta, et al.
- 1993
(Show Context)
Citation Context ...on and equality. This has later [66] incorporated constraint solving in a similar wayto the ACLP procedure. A bottom up procedure, later combined with some top down refinement, was given in [106] and =-=[42]-=-; the latter system was an implementation using the Model Generator MGTP developed on the multiprocessor machine developed at ICOT. Another recent abductive procedure in LP is that of AbDual [1] which... |

10 | Non-Deterministic Concurrent Logic Programming - Bahgat - 1993 |

10 | Negation as failure as an approach to the hanks and mcdermott problem - Evans - 1989 |

9 | Proof theory and semantics of logic programs - Gaifman, Shapiro - 1989 |

6 | Introduction to Arti Intelligence - Charniak, McDermott - 1985 |

6 |
An abductive procedure for disjunctive logic programming
- Dung
- 1993
(Show Context)
Citation Context ...ause p _ q can be replaced by the two clauses p q q p: With this transformation, for acyclic programs, the Eshghi-Kowalski procedure presented in section 4.2 is sound. For the more general case, Dung =-=[42]-=- represents disjunction explicitly and extends the Eshghi-Kowalski procedure by using resolution-based techniques similar to those employed in [57]. 5.6 Abduction through deduction from the completion... |

6 | Relating the tms to autoepistemic logic - Fujiwara, Honiden - 1989 |

5 |
Negation as failure revisited
- Dung, Kakas, et al.
- 1992
(Show Context)
Citation Context ... the well-founded semantics is minimalist and sceptical, whereas the preferred extension semantics is maximalist and credulous. The relationship between these two semantics is further investigated in =-=[47]-=-, where the well-founded model and preferred extensions are shown to correspond to the least xed point and greatest xed point, respectively, of the same operator. Kakas and Mancarella [96, 97] propose... |

5 | Abduction in Labelled Deductive Systems: a conceptual abstract - Gabbay - 1991 |

5 | Knowledge in Modelling the dynamics of epistemic states - Gardenfors - 1988 |

4 | A Rationale for Massively Parallel Programming with Sets - Hummel, Kelly - 1993 |

3 | contribution to The Fifth Generation Project: Personal Perspectives - Furukawa - 1993 |

3 | Labelled abduction and relevance reasoning - Gabbay, Kempson - 1991 |

2 |
An abductive foundation for non-monotonic truth maintenance
- Dung
- 1991
(Show Context)
Citation Context ...stable expansions of the set of justi cations viewed as autoepistemic theories. The JTMS can also be understood in terms of abduction using the abductive approach to the semantics of NAF, as shown in =-=[40, 71, 92]-=-. This has the advantage that the nogoods of the JTMS can be interpreted as integrity constraints of the abductive framework. The correspondence between abduction and the JTMS is reinforced by [170], ... |

2 | Diagnoses as stable models - Eshghi - 1990 |

1 | On The Relationship Between Truth - Kakas, Mancarella - 1990 |

1 |
Answer set semantics and constructive logic with strong negation
- Akama
- 1992
(Show Context)
Citation Context ...vestigated by Pearce and Wagner [130], who develop an extension of de nite programs by means of Nelson's strong negation. They also suggest the possibility ofcombining strong negation with NAF. Akama =-=[1]-=- argues that the semantics of this combination of strong negation with NAF is equivalent to the answer set semantics for extended logic programs developed by Gelfond and Lifschitz. The semantics of an... |

1 | Some proof procedures for computational theories, with an abductive to them - Casamayor, Decker - 1992 |

1 |
Abduction, induction and inverse resolution
- Console, Saitta
- 1992
(Show Context)
Citation Context ...ese two conditions (1) and (2) alone are too weak to capture Peirce's notion. In particular, additional restrictions on are needed to distinguish abductive explanations from inductive generalisations =-=[27]-=-. Moreover, we also need to restrict so that it conveys some reason why the observations hold, e.g. we do not want to explain one e ect in terms of another e ect, but only in terms of some cause. For ... |

1 |
An inference rule for hypotheses generation
- Demolombe, Cerro, et al.
- 1991
(Show Context)
Citation Context ...nd Mello [115] have developed an extension of the ATMS for the non-propositional case. Resolution-based techniques for computing abduction have also been developed by Demolombe and Fari~nas del Cerro =-=[31]-=- and Gaifman and Shapiro [64]. Abduction can also be applied to logic programming (LP). A (general) logic program is a set of Horn clauses extended by negation as failure [24], i.e. clauses of the for... |