(Enter summary)
Abstract: We present SLDNFA, an extension of SLDNF-resolution for abductive reasoning
on abductive logic programs. SLDNFA solves the floundering abduction
problem: non-ground abductive atoms can be selected. SLDNFA provides also
a partial solution for the floundering negation problem. Different abductive answers
can be derived from an SLDNFA-refutation; these answers provide different
compromises between generality and comprehensibility. Two extensions of SLDNFA
are proposed which satisfy stronger... (Update)
Context of citations to this paper: More
...other approach is based on abductive reasoning. For this we use an abductive solver (A system, 27] that implements SLDNFA resolution [16, 17] for computing a list of data facts that should be inserted to the database or retracted from it in order to keep the data consistent....
.... The System has been developed as a follow up of two earlier ALP systems, the ACLP system [Kakas et al. 2000] and SLDNFAC [Denecker and Schreye, 1998] , bringing together features from these two systems. The main development in the design of the System over these previous...
Cited by: More
Abductive Logic Programming with CIFF.. - Endriss.. (2004)
(Correct)
Abduction in Logic Programming - Denecker, Kakas
(Correct)
Temporal Reasoning with i-Abduction - Denecker, Van Belleghem
(Correct)
Active bibliography (related documents): More All
1.1: SLDNFA: an abductive procedure for normal abductive programs - Denecker, De Schreye (1992)
(Correct)
1.0: Temporal Reasoning with iff-Abduction - Denecker, van Belleghem
(Correct)
0.9: A Brief Overview of Logic Programming Research at.. - Martens..
(Correct)
Similar documents based on text: More All
0.9: Termination Analysis for Abductive General Logic Programs - Verbaeten (1999)
(Correct)
0.7: SLDNFA-system - Van Nuffelen
(Correct)
0.6: Temporal reasoning with Abductive Event Calculus - Denecker, Missiaen, Bruynooghe (1992)
(Correct)
Related documents from co-citation: More All
29: Abductive Logic Programming
- Kakas, Kowalski et al. - 1992
17: Negation as Failure (context) - Clark - 1978
17: the Relationship between Abduction and Deduction
- Console, Dupre et al. - 1991
BibTeX entry: (Update)
Denecker, M., and De Schreye, D. 1997. SLDNFA: an abductive procedure for abductive logic programs. http://citeseer.ist.psu.edu/denecker97sldnfa.html More
@article{ denecker98sldnfa,
author = "Marc Denecker and Danny De Schreye",
title = "{SLDNFA}: An Abductive Procedure for Abductive Logic Programs",
journal = "Journal of Logic Programming",
volume = "34",
number = "2",
pages = "111-167",
year = "1998",
url = "citeseer.ist.psu.edu/denecker97sldnfa.html" }
Citations (may not include all citations):
1838
Foundations of Logic Programming (context) - Lloyd - 1987 ACM
759
Negation as failure (context) - Clark - 1978 ACM DBLP
253
A Logical Framework for Default Reasoning (context) - Poole - 1988 ACM DBLP
235
First-Order Logic (context) - Smullyan - 1968
212
Abductive Logic Programming
- Kakas, Kowalski et al. - 1993 DBLP
186
Negation in Logic Programming (context) - Kunen - 1987 ACM DBLP
174
A Kripke-Kleene Semantics for Logic Programs (context) - Fitting - 1985 DBLP
166
Unification revisited (context) - Lassez, Maher et al. - 1988 ACM DBLP
156
Satchmo: a theorem prover implemented in prolog (context) - Manthey, Bry - 1988 DBLP
118
Complete axiomatizations of the algebras of finite (context) - Maher - 1988
117
the relationship between abduction and deduction
- Console, Dupre et al. - 1991
109
Constructive Negation Based on the Completed Database (context) - Chan - 1988 DBLP
109
Database updates through abduction (context) - Kakas, Mancarella - 1990 ACM DBLP
105
Making prolog more expressive (context) - Lloyd, Topor - 1984 DBLP
103
Prediction is deduction but explanation is abduction
- Shanahan - 1989 DBLP
88
Abductive planning with Event Calculus (context) - Eshghi - 1988 DBLP
77
Representing incomplete knowledge in abductive logic program..
- Denecker, De Schreye - 1993 ACM DBLP
77
Representing Incomplete Knowledge in Abductive Logic Program..
- Denecker, De Schreye - 1995 ACM DBLP
57
Intensional Updates: Abduction via Deduction (context) - Bry - 1990
56
Temporal reasoning with abductive event calculus
- Denecker, Missiaen et al. - 1992 ACM DBLP
52
Abduction compared with negation as failure (context) - Eshghi, Kowalski - 1989
50
The iff proof procedure for abductive logic programming (context) - Fung, Kowalski DBLP
48
Causes for events: their computation and application (context) - Cox, Pietrzykowski - 1986
34
an approach to constructive negation (context) - Drabent, failure - 1993
32
Integrity verification in knowledge bases (context) - Bry, Manthey et al. - 1991 ACM DBLP
32
Properties of Substitutions and Unifications (context) - Eder - 1985
30
Localized abductive planning with the event calculus (context) - Missiaen - 1991
30
Hypothetical Reasoning with Well Founded Semantics (context) - Pereira, Aparicio et al. - 1991 DBLP
28
Department of Computer Science (context) - Guessoum, Lloyd et al. - 1990
26
A Terminological Interpretation (context) - Denecker - 1995
26
Generalised stable models: a semantics for abduction (context) - Kakas, Mancarella - 1990
26
Knowledge Representation and Reasoning in Incomplete Logic P.. (context) - Denecker - 1993
26
A Query Evaluation method for Abductive Logic Programming (context) - Satoh, Iwayama - 1992 DBLP
24
an abductive procedure for normal abductive programs (context) - Denecker, De Schreye - 1992
22
A new definition of SLDNF-resolution
- Apt, Doets - 1994 ACM
21
Residue: a deductive approach to design synthesis (context) - Finger, Genesereth - 1985 ACM
20
an abductive planning system based on event calculus (context) - Missiaen, Denecker et al. - 1995
19
Justification semantics: a unifying framework for the semant.. (context) - Denecker, De Schreye - 1993
17
The role of logic in knowledge representation and commonsens.. (context) - Moore - 1982 DBLP
16
Partial deduction of the ground representation and its appli..
- Leuschel, Martens - 1995 DBLP
15
Information Processing Letters (context) - Martelli, Tricombi et al. - 1992
13
Describing Action and Change by Logic Programs (context) - Gelfond, Lifschitz - 1992
11
Bottom-up Abduction by Model Generation (context) - Inoue, Ohta et al. - 1993 DBLP
10
Philosophical Writings of Peirce (context) - Peirce - 1955
10
Localized abductive planning for robot assembly (context) - Missiaen - 1991
9
Transactions on Programming Languages and Systems (context) - Martelli, Montanari et al. - 1982
6
Integrity checking in stratified databases (context) - Lloyd, Sonenberg et al. - 1987
5
Introduction to Artifical Intelligence (context) - Charniak, McDermott - 1985
5
A family of abductive procedures for normal abductive progra.. (context) - Denecker, De Schreye - 1992
4
en zijn toepassing voor het redeneren over continue verander.. (context) - Bruneel, Clarebout et al. - 1994
4
volume 1 of Bibliotheca Mathematica (context) - Kleene, Metamathematics - 1952
3
An Abductive Proof Procedure Based on the Clark Completion (context) - Fung - 1995
3
Reasoning in an integration of Classical Logic and Logic Pro.. (context) - Denecker, De Schreye - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.kuleuven.ac.be/~dtai/publications/1998-E.shtml): More
Creating Specialised Integrity Checks Through Partial.. - Leuschel, De Schreye (1998)
(Correct)
Semantics-Based Program Analysis for Logic-Based Languages .. - Codish, Demoen, Sagonas (1998)
(Correct)
Detecting Unsolvable Queries for Definite Logic Programs - Bruynooghe.. (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC