W/lodzimierz Drabent IPI PAN, Polish Academy of Sciences Ordona 21, Pl -...  Home/Search
Context Related
| ida.liu.se/pub/labs/logpro/...sls.ps.gz 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: fermivista.math....ftp.ida.liu.se (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: SLS-resolution is an abstract query answering procedure for computing the well-founded semantics of normal programs. It is incomplete due to floundering. We present an extension of SLS-resolution that avoids this problem. 1 Introduction From the point of view of non-monotonic reasoning, the most suitable semantics for logic programs is the well-founded semantics [5]. It is equivalent to appropriate forms of all four major formalizations of non-monotonic reasoning [15]. The standard abstract... (Update)
Context of citations to this paper: More
.... Examples are intensional negation [3, 4] Chan s constructive negation [6, 7] the fail substitutions [23] and the fail answers [10, 9] techniques. The idea of intensional negation, originally formalized for positive logic programs [3, 4] is the following. Given a...
...for p(b) of rank ff exists only if a failed tree (a refutation) for p(b) exists for some rank ff. 2 Further examples are given in [Dra93b]. The following examples show the need for infinite ranks and for infinitely branching failed trees. Example 7.3 Consider a program even(0)...
Cited by: More
Semantics for Reasoning with Contradictory Extended Logic.. - Analyti, Pramanik (1994) (Correct)
Completeness Of SLDNF-Resolution For Non-Floundering Queries - Drabent (1994) (Correct)
Compilative Constructive Negation in Constraint Logic.. - Bruscoli, Levi, Levi, Meo (1994) (Correct)
Similar documents (at the sentence level):
15.3%: What is Failure? An Approach to Constructive Negation - Drabent (1994) (Correct)
Active bibliography (related documents): More All
0.2: Every Logic Program Has a Natural Stratification And an.. - Przymusinski (1989) (Correct)
0.2: Prolegomena to Logic Programming for Non-Monotonic.. - Jürgen Dix.. (1997) (Correct)
0.2: On Constructive Negation in Logic Programming - Przymusinski (1995) (Correct)
Similar documents based on text: More All
0.5: A Procedural Semantics for Well Founded Negation in Logic Programs - Ross (1989) (Correct)
0.3: The Notion of Floundering for SLDNF-Resolution Revisited - Réty (Correct)
0.3: Proving Correctness and Completeness of Normal Programs - a.. - Drabent (2001) (Correct)
Related documents from co-citation: More All
6: Constraint Logic Programming (context) - Jaffar, Lassez - 1987
6: Constructive negation for constraint logic programming (context) - Stuckey - 1995
5: Negation in logic programming (context) - Kunen - 1987
BibTeX entry: (Update)
W. Drabent. SLS-resolution without floundering. In L. M. Pereira and A. Nerode, editors, Proc. of the Workshop on Logic Programming and Non-monotonic reasoning, pages 82--98, 1993. http://citeseer.ist.psu.edu/47171.html More
@inproceedings{ drabent93slsresolution,
author = "Wlodzimierz Drabent",
title = "{SLS}-Resolution without Floundering",
booktitle = "Logic Programming and Non-monotonic Reasoning",
pages = "82-98",
year = "1993",
url = "citeseer.ist.psu.edu/47171.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
312 The well-founded semantics for general logic programs - van Gelder, Ross et al. - 1991
186 Negation in logic programming (context) - Kunen - 1987
118 Complete axiomatization of the algebras of finite (context) - Maher - 1988
112 OLD-resolution with tabulation (context) - Sato, Tamaki - 1986
109 Constructive negation based on the completed database (context) - Chan - 1988
88 Every logic program has a natural stratification and an iter.. - Przymusinski - 1989
70 Equational problems and disunification (context) - Comon, Lescanne - 1989
62 the declarative and procedural semantics of logic programs - Przymusinski - 1989
55 A procedural semantics for well founded negation in logic pr.. - Ross - 1992
48 A Basis for Deductive Database Systems (context) - Lloyd, Topor - 1985
30 Finite Representation of Infinite Query Answers - Chomicki, Imieli'nski - 1993
24 Language and equality theory in logic programming (context) - Shepherdson - 1991
19 A query evaluation method for stratified programs under the .. (context) - Seki, Itoh - 1988
15 A sound and complete semantics for a version of negation as .. (context) - Shepherdson - 1989
9 Complete logic programs with domain closure axiom (context) - Mancarella, Martini et al. - 1988
8 Three-valued non-monotonic formalisms and logic programming (context) - Przymusinski - 1989
8 Fail substitutions for negation as failure (context) - Ma, Naslund - 1989
1 Preliminary version appeared as Technical Report LiTH-IDA-R (context) - Drabent, failure et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.ida.liu.se.html): More
User Interface Design Support Tools and Critiquing - Ericsson (1994) (Correct)
Specification and Synthesis of Plans Using the Features and.. - Karlsson (1995) (Correct)
Computing Circumscription Revisited: Preliminary Report - Doherty, Lukaszewicz, Szalas (1995) (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