Sofie Verbaeten  Home/Search
Context Related
| cs.kuleuven.ac.be/~sofie/TRsldnfa.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.kuleuven.ac.be/~sofie/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an extension of the methods of Apt and Bezem for proving termination of general logic programs, to the case of abductive general logic programs. We consider programs executed under SLDNFA resolution, an abductive extension of SLDNF proposed by Denecker and De Schreye, w.r.t. an arbitrary safe selection rule. We show that the termination conditions for SLDNF of Apt and Bezem, namely acyclicity of the program and boundedness of the query, are not sufficient for ensuring termination... (Update)
Context of citations to this paper: More
...of [3] for SLDNFA executed under an arbitrary safe selection rule. We conclude in Section 5. We refer to the full version of the paper, [8], for a formal de nition of SLDNFA, a motivation of our choice for SLDNFA as proof procedure for abductive general programs (see also [7]...
Cited by: More
Characterisations of Termination in Logic Programming - Pedreschi, Ruggieri, Smaus (Correct)
Termination Analysis for Abductive General Logic Programs - Verbaeten (1999) (Correct)
Active bibliography (related documents): More All
0.3: SLDNFA: an abductive procedure for abductive logic programs - Denecker, De Schreye (1997) (Correct)
0.2: Temporal Reasoning with iff-Abduction - Denecker, van Belleghem (Correct)
0.2: Temporal Reasoning with i-Abduction - Denecker, Van Belleghem (Correct)
Related documents from co-citation: More All
2: Modular Termination Proofs for Logic and Pure Prolog Programs - Apt, Pedreschi - 1993
2: Termination of logic programs: the never-ending story (context) - De Schreye, Decorte - 1994
2: New Generation Computing (context) - Apt, Bezem - 1991
BibTeX entry: (Update)
S. Verbaeten. Termination analysis for abductive general logic programs. Technical report, Department of Computer Science, K.U.Leuven, 1999. Available at http://www.cs.kuleuven.ac.be/soe. 8 http://citeseer.ist.psu.edu/article/verbaeten99termination.html More
@inproceedings{ verbaeten99termination,
author = "Sofie Verbaeten",
title = "Termination Analysis for Abductive General Logic Programs",
booktitle = "International Conference on Logic Programming",
pages = "365-379",
year = "1999",
url = "citeseer.ist.psu.edu/article/verbaeten99termination.html" }
Citations (may not include all citations):1838 Foundations of logic programming (context) - Lloyd - 1987
212 Abductive Logic Programming - Kakas, Kowalski et al. - 1993
192 Logic programming (context) - Apt - 1990
172 Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
117 the relationship between abduction and deduction - Console, Dupre et al. - 1991
109 Database updates through abduction (context) - Kakas, Mancarella - 1990
103 Prediction is deduction but explanation is abduction - Shanahan - 1989
88 Abductive planning with Event Calculus (context) - Eshghi - 1988
77 Termination of logic programs: the never-ending story (context) - De Schreye, Decorte - 1994
72 New Generation Computing (context) - Apt, Bezem - 1991
56 Temporal reasoning with abductive event calculus - Denecker, Missiaen et al. - 1992
50 The iff proof procedure for abductive logic programming (context) - Fung, Kowalski - 1997
47 Modular termination proofs for logic and pure Prolog program.. - Apt, Pedreschi - 1994
39 SLDNFA: an abductive procedure for abductive logic programs - Denecker, De Schreye - 1998
26 A Query Evaluation method for Abductive Logic Programming (context) - Satoh, Iwayama - 1992
22 A new definition of SLDNF-resolution - Apt, Doets - 1994
20 an abductive planning system based on event calculus (context) - Missiaen, Denecker et al. - 1995
18 Declarative modelling of the operational behaviour of logic .. (context) - Falaschi, Levi et al. - 1989
11 A framework for analysing the termination of definite logic .. (context) - De Schreye, Verschaetse et al. - 1992
10 Localized abductive planning for robot assembly (context) - Missiaen - 1991
Documents on the same site (http://www.cs.kuleuven.ac.be/~sofie/): More
Modular Termination Proofs for Prolog with Tabling - Verbaeten, Sagonas, De Schreye (1999) (Correct)
Termination Analysis of Tabled Logic Programs Using Mode.. - Verbaeten, De Schreye (1999) (Correct)
Modular Termination Proofs for Prolog with Tabling - Verbaeten, Sagonas, De Schreye (1999) (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