Yi-Dong Shen, et al.  Home/Search
Context Related
| cs.ualberta.ca/~ydshen/TPLPR5.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: Infinite loops and redundant computations are long recognized open problems in Prolog. Two ways have been explored to resolve these problems: loop checking and tabling. Loop checking can cut infinite loops, but it cannot be both sound and complete even for function-free logic programs. Tabling seems to be an effective way to resolve infinite loops and redundant computations. However, existing tabulated resolutions, such as OLDT-resolution, SLG-resolution, and Tabulated SLS-resolution, are... (Update)
Context of citations to this paper: More
...which resolves in nite loops and redundant computations, without sacri cing the linearity of SLDNF resolution. In an earlier paper [11], we presented a linear tabling mechanism called TP resolution for positive logic programs ( TP for Tabulated Prolog ) In TP resolution,...
...the execution of the consumer needs to be resumed. In XSB, tabled calls are not allowed to occur in the scope of a cut. Shen et al. [9] proposed a strictly linear tabulated resolution, called SLDT in this paper, for Prolog. The main idea is as follows: Each tabled call can be...
Cited by: More
Implementation of a Linear Tabling Mechanism - Neng-Fa Zhou Department (2000) (Correct)
Suspending and Resuming Computations in Engines for SLG.. - Castro, Swift, Warren (Correct)
SLT-Resolution for the Well-Founded Semantics - Shen, Yuan, You (Correct)
Active bibliography (related documents): More All
1.6: Loop Checks for Logic Programs with Functions - Shen, Yuan, You (2001) (Correct)
0.5: An Extended Variant of Atoms Loop Check for Positive Logic Programs - Shen (1997) (Correct)
0.4: Linear Tabulated Resolution for the Well-Founded Semantics - Shen, Yuan, You, Zhou (1999) (Correct)
Similar documents based on text: More All
0.2: Numerical Pricing of Path-Dependent Options - Liu (1996) (Correct)
0.1: A Duplication and Loop Checking Free Proof System for S4 - Governatori (1996) (Correct)
0.1: Taking I/O Seriously: Resolution Reconsidered for Disk - Freire, Swift, Warren (Correct)
Related documents from co-citation: More All
6: Tabled Evaluation with Delaying for General Logic Programs - Chen, Warren - 1996
5: An abstract prolog instruction set (context) - Warren - 1983
5: Foundations of Logic Programming (context) - Lloyd - 1987
BibTeX entry: (Update)
Y. D. Shen, L. Y. Yuan, J. H. You and N. F. Zhou, Linear tabulated resolution based on Prolog control strategy, Theory and Practice of Logic Programming, to appear. http://citeseer.ist.psu.edu/294242.html More
@article{ shen01linear,
author = "Yi-Dong Shen and Li-Yan Yuan and Jia-Huai You and Neng-Fa Zhou",
title = "Linear tabulated resolution based on Prolog control strategy",
journal = "Theory and Practice of Logic Programming",
volume = "1",
number = "1",
pages = "71-122",
year = "2001",
url = "citeseer.ist.psu.edu/294242.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
435 Towards a theory of declarative knowledge (context) - Apt, Blair et al. - 1988
142 Tabled evaluation with delaying for general logic programs - Chen, Warren - 1996
112 OLD resolution with tabulation (context) - Tamaki, Sato - 1986
67 Negation as failure using tight derivations for general logi.. (context) - Van Gelder - 1989
66 Recursive query processing: the power of logic (context) - Vieille - 1989
58 Memoing for logic programs (context) - Warren - 1992
57 Tabulated resolution for the well-founded semantics - Bol, Degerstedt - 1998
47 Linear resolution with selection functions (context) - Kowalski, Kuehner - 1971
27 XSB as an ecient deductive database engine (context) - Sagonas, Swift et al. - 1994
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
11 Ecient top-down computation of queries under the well-founde.. (context) - Chen, Swift et al. - 1995
10 Parameter passing and control stack management in Prolog imp.. - Zhou - 1996
10 An abstract machine for tabled execution of xed-order strati.. (context) - Sagonas, Swift - 1998
7 An extended variant of atoms loop check for positive logic p.. - Shen - 1997
5 Eliminating unwanted loops in Prolog (context) - Covington - 1985
4 An abstract approach to some loop detection problems (context) - Skordev - 1997
4 Linear tabulated resolution for the well founded semantics - Shen, Yuan et al. - 1999
3 Ecient loop detection in Prolog (context) - Van Gelder - 1987
3 Redundancy elimination and loop checks for logic programs (context) - Ferrucci, Pacini et al. - 1995
1 The underlying search for magic templates and tabulation (context) - Resolution, Degerstedt - 1993
Documents on the same site (http://www.cs.ualberta.ca/~ydshen/): More
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)
SLT-Resolution for the Well-Founded Semantics - Shen, Yuan, You (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