David Kemp  Home/Search
Context Related
| att.com/~divesh/papers/kss92wfn.ps att.com/~divesh/papers/kss92wfn.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: att.com/~divesh/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Several program transformations---magic sets, envelopes, NRSU transformations and context transformations, among others---have been proposed for efficiently computing the answers to a query while taking advantage of the query constants. These transformations use sideways information passing strategies (sips) to restrict bottom-up evaluation to facts potentially relevant to the query. It is of interest to extend these transformations to all logic programs with negation, and identify classes of... (Update)
Context of citations to this paper: More
.... the magic sets techniques to larger classes of programs with negation, be it stratified, modularly stratified, or general negation [Ros90, RSS92, Mor93, KSS92]. In general, the larger the class of programs allowed, the fewer options there are for optimization, and so we look for...
...thereby giving semantics to every program. For this semantics several query evaluation procedures have been defined [7, 11, 13, 32, 47, 53, 54, 57, 61]. The well founded semantics deals only with normal programs, i.e. those with just negation by default, and thus it provides...
Cited by: More
A Framework for Goal-Directed Bottom-Up Evaluation of.. - Almendros-Jiménez, al. (Correct)
Tabled Evaluation with Delaying for General Logic Programs - Weidong Chen Computer (1996) (Correct)
Top-Down Query Evaluation for Well-Founded Semantics .. - Alferes.. (1994) (Correct)
Similar documents (at the sentence level):
12.0%: Bottom-up Evaluation and Query Optimization of.. - Kemp, Srivastava, Stuckey (1995) (Correct)
9.7%: Bottom-up Evaluation and Query Optimization of Well-Founded - Models David Kemp (1995) (Correct)
5.0%: Magic Sets and Bottom-up Evaluation of Well-Founded Models - Kemp, Stuckey (1991) (Correct)
Active bibliography (related documents): More All
0.3: Right-, Left- and Multi-Linear Rule Transformations That.. - David Kemp (1990) (Correct)
0.3: Well-Founded Ordered Search: Goal directed bottom-up.. - Stuckey, Sudarshan (1997) (Correct)
0.3: A Survey of Research on Deductive Database Systems - Ramakrishnan, Ullman (1993) (Correct)
Similar documents based on text: More All
0.2: Controlling the Search in Bottom-Up Evaluation - Ramakrishnan, Srivastava.. (1992) (Correct)
0.2: Parallelism in Logic Programs - Ramakrishnan (1990) (Correct)
0.2: Magic Conditions - Mumick, Finkelstein, Pirahesh.. (1990) (Correct)
Related documents from co-citation: More All
13: Foundations of Logic Programming (context) - Lloyd - 1987
11: A procedural semantics for well founded negation in logic programs - Ross - 1989
11: Magic sets and bottom-up evaluation of well-founded models - Kemp, Stuckey et al. - 1991
BibTeX entry: (Update)
David B. Kemp, Peter J. Stuckey, and Divesh Srivastava. Query restricted bottom-up evaluation of normal logic programs. In Joint Intl. Conference and Symposium on Logic Programming, pages 288--302, 1992. http://citeseer.ist.psu.edu/article/kemp92query.html More
@inproceedings{ kemp92query,
author = "Kemp, D. B. and Stuckey, P. J. and Srivastava, D.",
title = "Query Restricted Bottom-Up Evaluation of Normal Logic Programs",
booktitle = "Proceedings of the Joint International Conference and Symposium on Logic Programming",
publisher = "The MIT Press",
address = "Washington, USA",
editor = "Apt",
isbn = "0-262-51064-2",
pages = "288-302",
year = "1992",
url = "citeseer.ist.psu.edu/article/kemp92query.html" }
Citations (may not include all citations):1838 Foundations of logic programming (context) - Lloyd - 1987
981 Principles of database and knowledge-base systems (context) - Ullman - 1989
312 The well-founded semantics for general logic programs - Van Gelder, Ross et al. - 1991
204 Magic sets and other strange ways to implement logic program.. (context) - Bancilhon, Maier et al. - 1986
115 The Alternating Fixpoint of Logic Programs with Negation (context) - Van Gelder - 1989
113 Relations and Logic (context) - Ramakrishnan, Srivastava et al. - 1992
73 Modular Stratification and Magic Sets for DATALOG Programs w.. (context) - Ross - 1990
50 Bottom-up beats top-down for Datalog (context) - Ullman - 1989
31 Magic sets and bottom-up evaluation of well-founded models - Kemp, Srivastava et al. - 1991
26 Efficient evaluation of right (context) - Naughton, Ramakrishnan et al. - 1989
25 Design overview of the Aditi deductive database system (context) - Vaghani, Ramamohanarao et al. - 1991
12 and multi-linear rule transformations that maintain context .. (context) - Kemp, Ramamohanarao et al. - 1990
11 Is there anything better than magic (context) - Sagiv - 1990
8 and Ramakrishnan (context) - Beeri - 1987
6 Overbound and right-linear queries - Mumick, Pirahesh - 1991
4 Dualities between alternate semantics for logic programming .. (context) - Baral, Subrahmanian - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.att.com/~divesh/papers/index.html): More
Data Model and Query Evaluation in Global Information Systems - Levy, Srivastava, Kirk (1991) (Correct)
Interaction of Query Evaluation and Buffer Management.. - Jónsson, Franklin.. (1998) (Correct)
Chasing Constrained Tuple-Generating Dependencies - Maher, Srivastava (1996) (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