W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20--74, 1996. Home/Search Document Details and Download
Summary ACM TOC Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
SLT-Resolution for the Well-Founded Semantics - Shen, Yuan, You (Correct)
.... sub derivations [2, 9, 35] The first problem with SLDNF resolution has been perfectly settled by the discovery of the well founded semantics [33] Two representative methods were then proposed for topdown evaluation of such a new semantics: Global SLS resolution [18, 22] and SLG resolution [6, 7]. Global SLS resolution is a direct extension of SLDNF resolution. It overcomes the semantic anomalies of SLDNF resolution by treating infinite derivations as failed and infinite recursions through negation as undefined. Like SLDNF resolution, it is linear for query evaluation. However, it ....
....store intermediate results of relevant subgoals and then use them to solve variants of the subgoals whenever needed. With tabling no variant subgoals will be recomputed by applying the same set of program clauses, so infinite loops can be avoided and redundant computations be substantially reduced [4, 7, 30, 35, 37]. Like all other existing tabling mechanisms, SLG resolution adopts the solution lookup mode. That is, all nodes in a search tree forest are partitioned into two subsets, solution nodes and lookup nodes. Solution nodes produce child nodes only using program clauses, whereas lookup nodes produce ....
[Article contains additional citation context not shown here]
W. D. Chen and D. S. Warren, Tabled evaluation with delaying for general logic programs, J. ACM 43(1):20-74 (1996).
Delegation Logic: A Logic-based Approach to Distributed Authorization - Li (2000) (21 citations) (Correct)
....[51] XD1LP includes a compiler that compiles a D1LP into OLP rules in an internal format and a meta interpreter that can answer queries using these rules. XD1LP turns the XSB engine into a D1LP engine. 75 XSB has several nice features that most Prolog systems do not have. It uses SLG resolution [18], which has tabling ability. SLG resolution enables XSB to evaluate correctly many recursive logic programs that would make SLD resolution based Prolog systems get into an infinite loop. This is crucial to our work, because delegation relationships can be circular. XSB also supports HiLog ....
Weidong Chen and David S. Warren, "Tabled Evaluation with Delaying for General Logic Programs," Journal of the ACM, 43:1, pp. 20--74, Janurary 1996. ftp://ftp.cs.sunysb.edu/pub/XSB/doc/SLG/slg-jacm.ps.gz
Logical Algorithms - Ganzinger, McAllester (2002) (1 citation) (Correct)
....model is not particularly novel. The language is variant of bottom up logic programming. Bottom up logic programming has been widely studied in the context of deductive databases [13, 11, 6, 12] Bottom up logic programming is closely related to memoing or tabling for Prolog programs [10, 9, 1]. The bottom up language described here allows deletion. Our notion of deletion is superficially similar to widely studied notions of negation in logic programming such as well founded (stratified) programs [8, 4] and stable model semantics [3] Here, however, we use a don t care ....
Weidong Chen and David S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20--74, 1996.
Combining Logic Programs and Monadic Second Order.. - Fioravanti.. (Correct)
....; that computes the maximum number of a set, terminates for all ground queries, but in Section 5 we will give an example where the program derived by applying the typed Lloyd Topor transformation does not terminate. Similar termination problems may occur if one uses tabled resolution [5], instead of SLDNF resolution. To overcome this problem, we apply to the program NatSet [ Cls(f; the unfold fold transformation strategy which we will describe in Section 5. In particular, by applying this strategy we derive de nite programs which terminate for all ground queries by using ....
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. JACM, 43(1), 1996.
From Datalog Rules to Optimal Algorithms with Time and Space.. - Liu, Stoller (2003) (Correct)
....time and space complexities supported by the algorithm and the data structures. Optimization methods for Datalog include smart evaluation methods and rewriting methods [10] The former includes bottom up evaluation [10, 25] semi naive evaluation [10] and topdown evaluation with tabling [35, 11]. The latter includes magic sets transformation [6] among others [10] Our method is not an evaluation method because it transforms the rules rather than evaluating them; our method is not a rewriting method in that it does not transform within the frameworks of rules or some algebras. Instead, ....
....computation based on careful incremental updates with data structure support. Previous methods for evaluating or rewriting Datalog rules mostly do not provide complexity 18 analysis [10] In fact, such analysis can be very dicult. For example, for top down evaluation with tabling and indexing [35, 11, 31], a graph reachability program may have several di erent time complexities between linear and quadratic, depending on the order of the rules, the order of the hypotheses in a rule, the indexing used, etc. It is well known that a Datalog program runs in O(n k ) time where k is the largest number ....
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. J. ACM, 43(1):20-74, Jan. 1996.
Delegation Logic: A Logic-based Approach to Distributed.. - Li, Grosof, Feigenbaum (2000) (21 citations) (Correct)
....[28] XD1LP includes a compiler that compiles a D1LP into OLP rules in an internal format and a meta interpreter that can answer queries using these rules. XD1LP turns the XSB engine into a D1LP engine. XSB has several nice features that most Prolog systems do not have. It uses SLG resolution [10], which has tabling ability. SLG resolution enables XSB to evaluate correctly many recursive logic programs that would make SLD resolutionbased Prolog systems get into an infinite loop. This is crucial to our work, because delegation relationships can be circular. XD1LP implements a slightly less ....
Weidong Chen and David S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20--74, January 1996.
Delegation Logic: A Logic-based Approach to Distributed.. - Li, Grosof (2000) (21 citations) (Correct)
....XD1LP includes a compiler that compiles a D1LP into OLP rules in an internal format and a meta interpreter that can answer queries using these rules. XD1LP turns the XSB engine into a D1LP engine. 36 XSB has several nice features that most Prolog systems do not have. It uses SLG resolution [10], which has tabling ability. SLG resolution enables XSB to evaluate correctly many recursive logic programs that would make SLD resolutionbased Prolog systems get into an infinite loop. This is crucial to our work, because delegation relationships can be circular. XD1LP uses an alternative ....
Weidong Chen and David S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20--74, January 1996.
CHR for XSB - Schrijvers, Warren, Demoen (2003) Self-citation (Warren) (Correct)
No context found.
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20--74, 1996.
Constraint Handling Rules and Tabled Execution - Schrijvers, Warren (2004) Self-citation (Warren) (Correct)
No context found.
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20--74, 1996.
The Limits of Fixed-Order Computation - Sagonas, Swift, Warren (1996) (2 citations) Self-citation (Warren) (Correct)
No context found.
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20--74, Jan. 1996.
Suspending and Resuming Computations in Engines for SLG.. - Castro, Swift, Warren Self-citation (Warren) (Correct)
....in nite loops in a derivation, and determine whether negative calls are involved in these paths. This allows tabling to detect unfounded sets and thereby form a basis for implementing the well founded semantics [15] Indeed, many implementations of the well founded semantics, such as SLG [2] use tabling. SLG evaluations are modeled as a sequence of forests of SLG trees. In any forest, several di erent computation paths may be active and awaiting the production of answers from other computation paths. The need to maintain several active computation paths requires memory management ....
....that have been implemented for the SLGWAM architecture: SLGWAM 98 , CHAT, S ntese, and YapTab . Using a suite of Prolog and tabled programs, we compare and analyze time and space performance of all engines. 2 SLG Evaluation In this section we review informally those aspects of SLG Resolution [2], that are relevant to the discussions that follow. An SLG evaluation can be modeled as a (possibly trans nite) sequence of forests of trees that is, the state of an SLG evaluation can be modeled as a forest in which each subgoal encountered by an evaluation is represented by the root of a tree ....
W. Chen and D. S. Warren. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1):20-74, January 1996.
Uncertainty Management in Logic Programming: Simple and.. - Straccia (Correct)
No context found.
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20--74, 1996.
Using Datalog with Binary Decision Diagrams for Program.. - Whaley, Avots, Carbin, Lam (Correct)
No context found.
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. J. ACM, 43(1):20--74, 1996.
Query Answering in Normal Logic Programs under Uncertainty - Straccia (Correct)
No context found.
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20--74, 1996.
Basic Research in Computer Science - Fast Partial Evaluation (Correct)
No context found.
Weidong Chen and David S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20--74, January 1996.
Abduction with Hypotheses Confirmation - Alberti, Gavanelli, Lamma, Mello, .. (2004) (Correct)
No context found.
Chen, W., Warren, D.S.: Tabled evaluation with delaying for general logic programs. Journal of the ACM 43 (1996) 20--74
Combining Logic Programs and Monadic Second Order.. - Fioravanti.. (Correct)
No context found.
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. JACM, 43(1), 1996.
Composite Distributive Lattices as Annotation Domains for.. - Calmet, Kullmann, Taneda (2000) (Correct)
No context found.
Chen, Weidong; Warren, David S.: Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1):20--74, 1996.
Implementation Of Local Grounding For Logic Programs With Stable .. - Syrjänen (1998) (Correct)
No context found.
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the Association for Computing Machinery, 43:20-74, 1 1996.
A Model Checker for Value-Passing - Mu-Calculus Using Logic (Correct)
No context found.
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20--74, January 1996.
A Memoizing Semantics for - Functional Logic Languages (Correct)
No context found.
W. Chen and D. S. Warren. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1):20--74, 1996.
Advanced Techniques for Logic Program Specialisation - Leuschel (1997) (10 citations) (Correct)
No context found.
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20-74, January 1996.
Scalability and Efficiency in Multi-Relational Data Mining - Blockeel, Sebag (2003) (1 citation) (Correct)
No context found.
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20-74, January 1996. http://www.cs.sunysb.edu/~sbprolog.
Implementation of a Linear Tabling Mechanism - Neng-Fa Zhou Department (2000) (4 citations) (Correct)
No context found.
Chen, W. and Warren, D.S.: Tabled Evaluation with Delaying for General Logic Programs, J. ACM, Vol.43, No.1, 20-74, 1996.
From Datalog Rules to Efficient Programs with Time and Space.. - Liu, Stoller (2003) (2 citations) (Correct)
No context found.
W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. J. ACM, 43(1):20--74, Jan. 1996.
First 50 documents Next 50
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