Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You  Home/Search
Context
Related
| cs.ualberta.ca/%7Eydshen/slt.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.ualberta.ca/~ydshen/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Global SLS-resolution and SLG-resolution are two representative mechanisms for top-down evaluation of the well-founded semantics of general logic programs. Global SLS-resolution is linear for query evaluation but suffers from infinite loops and redundant computations. In contrast, SLG-resolution resolves infinite loops and redundant computations by means of tabling, but it is not linear. The principal disadvantage of a non-linear approach is that it cannot be implemented using a simple,... (Update)
Active bibliography (related documents): More All
0.6: Linear Tabulated Resolution Based on Prolog Control Strategy - Shen, al. (Correct)
0.6: Loop Checks for Logic Programs with Functions - Shen, Yuan, You (2001) (Correct)
0.5: Linear Tabulated Resolution for the Well-Founded Semantics - Shen, Yuan, You, Zhou (1999) (Correct)
Similar documents based on text: More All
0.7: Implementation of a Linear Tabling Mechanism - Zhou, Shen, Yuan, You (2000) (Correct)
0.5: A General Theory of Confluent Rewriting Systems for Logic.. - Dix, Osorio, Zepeda (2001) (Correct)
0.5: Equivalence of Well-Founded and Stable Semantics - Gire (Correct)
BibTeX entry: (Update)
@article{ shen02sltresolution,
author = "Yi-Dong Shen and Li-Yan Yuan and Jia-Huai You",
title = "{SLT}-Resolution for the Well-Founded Semantics",
journal = "Journal of Automated Reasoning",
volume = "28",
number = "1",
pages = "53-97",
year = "2002",
url = "citeseer.ist.psu.edu/592636.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
759 Negation as Failure (context) - Clark - 1978
634 A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
395 An abstract Prolog instruction set (context) - Warren - 1983
379 The complexity of relational query languages (context) - Vardi - 1982
234 The well-founded semantics for general logic programs - Van Gelder, Ross et al. - 1991
162 The semantics of predicate logic as a programming language (context) - Van Emden, Kowalski - 1976
159 Predicate logic as a programming language (context) - Kowalski
144 Contributions to the theory of logic programming (context) - Apt, Van Emden - 1982
142 Tabled evaluation with delaying for general logic programs - Chen, Warren - 1996
112 XSB as an efficient deductive database engine - Sagonas, Swift et al. - 1994
112 OLD resolution with tabulation (context) - Tamaki, Sato - 1986
109 Constructive negation based on the completed database (context) - Chan - 1988
68 Negation in logic programming (context) - Shepherdson - 1988
66 Recursive query processing: the power of logic (context) - Vieille - 1989
62 the declarative and procedural semantics of logic programs - Przymusunski - 1989
61 Termination of logic programs: the never-ending story (context) - De Schreye, Decorte - 1993
58 Memoing for logic programs (context) - Warren - 1992
57 Tabulated resolution for the well-founded semantics - Bol, Degerstedt - 1998
55 A procedural semantics for well-founded negation in logic pr.. - Ross - 1992
48 Efficient top-down computation of queries under the well-fou.. - Chen, Swift et al. - 1995
47 Linear resolution with selection functions (context) - Kowalski, Kuehner - 1971
34 An approach to constructive negation (context) - Drabent, failure - 1995
28 Negation as failure using tight derivations for general logi.. (context) - Van Gelder - 1989
28 An abstract machine for tabled execution of fixed-order stra.. (context) - Sagonas, Swift - 1998
23 An analysis of loop checking mechanisms for logic programs (context) - Bol, Apt et al. - 1991
20 The XSB Programmer's Manual (context) - Sagonas, Swift et al. - 1998
19 The underlying search for magic templates and tabulation - Bol, Degerstedt - 1993
10 Parameter passing and control stack management in Prolog imp.. - Zhou - 1996
7 An extended variant of atoms loop check for positive logic p.. - Shen - 1997
6 Logic Programming and Prolog (context) - Nilsson, Maluszynski - 1995
6 Linear tabulated resolution based on Prolog control strategy - Shen, Yuan et al. - 2001
5 Constructive negation under the well-founded semantics - Liu, Adams et al. - 1999
4 Linear tabulated resolution for the well founded semantics - Shen, Yuan et al. - 1999
1 Every logic program has a natural stratification and an iter.. (context) - Przymusunski - 1989
1 The well-founded semantics coincides with the three-valued s.. (context) - Przymusunski - 1990
1 On constructive negation in logic programming (context) - Przymusunski - 1989
Documents on the same site (http://www.cs.ualberta.ca/~ydshen/): More
Linear Tabulated Resolution Based on Prolog Control Strategy - Shen, al. (Correct)
Loop Checks for Logic Programs with Functions - Shen, Yuan, You (2001) (Correct)
An Extended Variant of Atoms Loop Check for Positive Logic Programs - Shen (1997) (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