Krzysztof R. Apt  Home/Search
Context Related
| cwi.nl/~apt/sldnf.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: cwi.nl/~apt/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We propose a new, "top-down" definition of SLDNF-resolution which retains the spirit of the original definition but avoids the difficulties noted in the literature. We compare it with the "bottom-up" definition of Kunen [Kun89]. 1 The problem The notion of SLD-resolution of Kowalski [Kow74] allows us to resolve only positive literals. As a result it is not adequate to compute with general programs. Clark [Cla79] proposed to incorporate the negation as finite failure rule. This leads to an... (Update)
Context of citations to this paper: More
...A fails, then :A succeeds. SLDNF resolution There are variants of the original resolution procedure introduced by Clark, for instance [3, 22], but we would rather follow that given in [22] SLDNFresolution is SLD resolution augmented by negation as finite failure. Informally,...
.... quest for extending the appropriate soundness and completeness results to logic programs that allow negation (see, e.g. Apt Bol (1994)) To complicate the matters further, Prolog extends logic programming with negation by several features that are very operational...
Cited by: More
SLDNFA: an abductive procedure for abductive logic programs - Denecker, De Schreye (1997) (Correct)
Towards Full Prolog - Apt (Correct)
Formulas as Programs - Apt, Bezem (1998) (Correct)
Similar documents (at the sentence level):
9.1%: Logic Programming and Negation: A Survey - Apt, Bol (1994) (Correct)
Active bibliography (related documents): More All
0.3: Declarative Programming in Prolog - Apt (1993) (Correct)
0.3: Program Verification and Prolog - Apt (1994) (Correct)
0.2: Advanced Techniques for Logic Program Specialisation - Leuschel (1997) (Correct)
Similar documents based on text: More All
0.2: Completeness Of SLDNF-Resolution For Non-Floundering Queries - Drabent (1994) (Correct)
0.1: Symmetries in Logic Programs - Wu (Correct)
0.1: Meta-variables in Logic Programming, or in Praise of Ambivalent.. - Apt (1996) (Correct)
Related documents from co-citation: More All
16: Foundations of Logic Programming (context) - Lloyd - 1987
13: Logic Programming and Negation: A Survey - Apt, Bol - 1994
11: Negation as Failure (context) - Clark - 1978
BibTeX entry: (Update)
Apt K. R. , Doets H. C.: A new definition of SLDNF-resolution. Tech. Rep. CS-R9242. CWI, Amsterdam, NL (1992) http://citeseer.ist.psu.edu/apt92new.html More
@article{ apt94new,
author = "K. R. Apt and K. Doets",
title = "A New Definition of {SLDNF}-Resolution",
journal = "The Journal of Logic Programming",
volume = "18",
number = "2",
month = "February",
pages = "177--190",
year = "1994",
url = "citeseer.ist.psu.edu/apt92new.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1984
1838 Foundations of Logic Programming (context) - Lloyd - 1987
159 Predicate logic as a programming language (context) - Kowalski - 1974
109 Constructive negation based on the completed database (context) - Chan - 1988
78 Predicate logic as a computational formalism (context) - Clark - 1979
72 New Generation Computing (context) - Apt, Bezem - 1991
41 Proving termination of general Prolog programs (context) - Apt, Pedreschi - 1991
22 Negation as failure: a comparison of Clark's completed data .. (context) - Shepherdson - 1984
15 A sound and complete semantics for a version of negation as .. (context) - Shepherdson - 1989
15 Information Processing Letters (context) - Martelli, Tricomi et al. - 1992
8 Journal of Logic and Computation (context) - Doets - 1992
4 Signed data depedencies in logic programs (context) - Kunen - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cwi.nl/~apt/): More
Reasoning about Termination of Pure Prolog Programs - Apt, Pedreschi (1993) (Correct)
A Declarative Approach for First-Order Built-in's of Prolog - Apt (1992) (Correct)
Reasoning about Prolog Programs: from Modes through Types to.. - Apt, Marchiori (1994) (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