(Enter summary)
Abstract: SLG is a table-oriented resolution method that combines the deductive
database and logic programming paradigms. SLG is applicable to deductive
databases since it terminates and has polynomial data complexity
for programs with finite models. In terms of the logic programming (and
non-monotonic) paradigms, SLG computes the well-founded model for nonstratified
programs, and has been extended to compute 3-valued stable model
semantics.
This paper presents performance analysis and comparisons of the ... (Update)
Context of citations to this paper: More
.... or the TP operator can be utilized for constraint query evaluation, e.g. the semi naive bottom up evaluation [22] or the SLG resolution [18, 21]. 3.2. Termination We show termination of an arbitrary Datalog jZ program by showing that the set of all possible periodicity graphs...
.... of an alternating fixpoint query evaluation procedure for Datalog C; 1 Benchmarks for main memory systems can be found in [25, 11, 27] and for a diskbased system in [6] 2 A set at a time like computation is easily achieved by allowing finite disjunction constraints....
Cited by: More
Fluents: a Uniform Extension of Kernel Prolog for Reflection and.. - Tarau (2000)
(Correct)
Foundations Of Temporal Query Languages - Toman (1995)
(Correct)
Top-Down beats Bottom-Up for Constraint Extensions of Datalog - Toman (1995)
(Correct)
Similar documents (at the sentence level): More
63.0%: Analysis of Sequential SLG Evaluation - Swift, Warren (1994)
(Correct)
47.5%: Efficient Evaluation of Normal Logic Programs - Swift (1994)
(Correct)
17.3%: Performance of Sequential SLG Evaluation - Swift, Warren (1993)
(Correct)
Active bibliography (related documents): More All
0.7: Dynamic Argument Reduction for In-memory Data Queries - Rao, Ramakrishnan, Swift.. (1994)
(Correct)
0.5: Parallelizing Tabled Evaluations (Extended Abstract) - Freire, al.
(Correct)
0.4: A Summary of XSB Performance - Swift, Warren (1993)
(Correct)
Similar documents based on text: More All
1.1: Memory Management and Scheduling in a Tabling Engine - Castro, Swift, Warren (2001)
(Correct)
0.4: Operational Semantics for SLG Evaluation. Part 1: Modularly .. - Swift, Chen, Warren (1994)
(Correct)
0.4: Suspending and Resuming Computations in Engines for SLG.. - Castro, Swift, Warren
(Correct)
Related documents from co-citation: More All
6: A Closed-Form Evaluation for Datalog Queries with Integer
- Revesz - 1993
5: Datalog with Integer Periodicity Constraints
- Toman, Chomicki et al. - 1994
5: Ullman J. D.: Principles of Database and Knowledge-Base Systems, Volumes 1 and 2. Computer Science Press, 1988. This article was processed using the L scaled 913a T E X macro package with LLNCS style
BibTeX entry: (Update)
T. Swift and D. S. Warren. Analysis of SLG-WAM evaluation of definite programs. In Bruynooghe [3], pages 219--235. http://citeseer.ist.psu.edu/189695.html More
@inproceedings{ swift94analysis,
author = "Terrance Swift and David Scott Warren",
title = "Analysis of {SLG}-{WAM} Evaluation of Definite Programs",
booktitle = "Symposium on Logic Programming",
pages = "219-235",
year = "1994",
url = "citeseer.ist.psu.edu/189695.html" }
Citations (may not include all citations):
395
An abstract Prolog instruction set (context) - Warren - 1983
112
XSB as an efficient deductive database engine
- Sagonas, Swift et al. - 1994
47
IEEE Transactions on Knowledge and Data Engineering (context) - Chimenti, Gamboa et al. - 1990
39
Design and implementation of the GlueNail database system
- Derr, Morishita et al. - 1993
38
A survey of research on deductive database systems
- Ramakrishnan, Ullman - 1993
25
CORAL: Control (context) - Ramakirshnan, Srivastava et al. - 1992
25
Design overview of the Aditi deductive database system (context) - Vaghani, Ramamohanorao et al. - 1991
21
Argument reduction through factoring (context) - Naughton, Ramakirshnan et al. - 1989
21
Optimizations of bottom-up evaluation with non-ground terms (context) - Sudarshan, Ramakirshnan - 1993
20
a short overview (context) - Vieille, Bayer et al. - 1990
19
Towards effective evaluation of general logic programs
- Chen, Warren - 1993
18
Optimizing Bottom-up Query Evaluation for Deductive Database.. (context) - Sudarshan - 1992
15
Efficient implementation of general logical queries (context) - Chen, Swift et al. - 1993
14
the power of alexandrer templates (context) - Seki - 1989
8
An amateur's introdution to recursive query processing strat.. (context) - Banchillon, Ramakrishnan - 1986
6
An abstract machine for SLG resolution (context) - Swift, Warren - 1994
4
Dynamic argument reduction for in-memory queries (context) - Rao, Ramakrishnan et al. - 1994
4
Performance of sequential SLG evaluation
- Swift, Warren - 1993
3
LDL User's Guide (context) - Tsur, Arni et al. - 1993
3
Recursion versus iteration in Prolog (context) - Meier - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.sunysb.edu/~tswift/terry-papers.html): More
Beyond Depth-First: Improving Tabled Logic Programs through.. - Freire (1996)
(Correct)
Efficient Model Checking Using Tabled Resolution - Ramakrishna, Ramakrishnan.. (1997)
(Correct)
XSB: A System for Efficiently Computing Well-Founded.. - Rao, Sagonas, Swift.. (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