See this document in CiteSeerX!

Magic Sets and Bottom-up Evaluation of Well-Founded Models (1991)  (Make Corrections)  (31 citations)
David B. Kemp, Peter J. Stuckey
Logic Programming, Proceedings of the 1991 International Symposium



  Home/Search   Context   Related

 
View or download:
att.com/~divesh/papers/kss91wfn.ps
att.com/~divesh/papers/kss91wfn.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  att.com/~divesh/papers/index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present a bottom-up operational procedure for computing well-founded models of allowed DATALOG programs with negation. This procedure provides a practical method of handling programs that involve unstratified negation in a manner that may be mixed with other evaluation approaches, such as semi-naive evaluation. We also define classes of programs and sips for which the magic sets transformation preserves well-founded models with respect to the query. The class of programs and sips we consider ... (Update)

Context of citations to this paper:   More

...tuples (or subgoals) so as to ensure that a positive subgoal be fully evaluated before its negative counterpart is solved. Kemp et al. [18] developed a technique that computes the wellfounded partial model using a doubled program, one for deriving definitely true answers and...

...computations. They also study semantic models and magic transformations for deductive database languages with negation [KSS95, KSS92, KSS91] Thus, we may say that the bottom up evaluation is better than top down one w.r.t. positive goals: bottom up evaluation is a complete...

Cited by:   More
Bottom-up Evaluation and Query Optimization of Well-Founded - Models David Kemp (1995)   (Correct)
A Framework for Goal-Directed Bottom-Up Evaluation of.. - Almendros-Jiménez, al.   (Correct)
Computation of Non-Ground Disjunctive Well-Founded Semantics .. - Dix, Stolzenburg (1997)   (Correct)

Similar documents (at the sentence level):
37.7%:   Bottom-up Evaluation and Query Optimization of.. - Kemp, Srivastava, Stuckey (1995)   (Correct)
5.0%:   Query Restricted Bottom-up Evaluation of Normal Logic Programs - Kemp (1992)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Right-, Left- and Multi-Linear Rule Transformations That.. - David Kemp (1990)   (Correct)
0.3:   A Survey of Research on Deductive Database Systems - Ramakrishnan, Ullman (1993)   (Correct)
0.3:   Efficient Bottom-Up Evaluation Of Logic Programs - Ramakrishnan, Srivastava.. (1992)   (Correct)

Similar documents based on text:   More   All
0.2:   Overbound and Right-Linear Queries - Mumick, Pirahesh (1991)   (Correct)
0.2:   Parallelism in Logic Programs - Ramakrishnan (1990)   (Correct)
0.2:   Tabled Evaluation with Delaying for General Logic Programs - Chen, Warren (1996)   (Correct)

Related documents from co-citation:   More   All
15:   A Classification-Theory of Semantics of Normal Logic Programs: I. Strong Propert.. - Dix - 1995
15:   A goal-oriented approach to computing well founded semantics (context) - Chen, Warren - 1992
14:   The Well-Founded Semantics for General Logic Programs - Van Gelder, Ross et al. - 1991

BibTeX entry:   (Update)

David B. Kemp, Peter J. Stuckey, and Divesh Srivastava. Magic sets and bottom-up evaluation of well-founded models. In Intl. Logic Programming Symposium, pages 337--351, 1991. http://citeseer.ist.psu.edu/kemp91magic.html   More

@inproceedings{ david91magic,
    author = "Kemp, David B. and Srivastava, Divesh and Peter J. Stuckey",
    title = "Magic Sets and Bottom-Up Evaluation of Well-Founded Models",
    booktitle = "Logic Programming, Proceedings of the 1991 International Symposium",
    publisher = "The MIT Press",
    address = "San Diego, USA",
    editor = "Saraswat, Vijay and Ueda, Kazunori",
    pages = "337--354",
    year = "1991",
    url = "citeseer.ist.psu.edu/kemp91magic.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
204   Magic sets and other strange ways to implement logic program.. (context) - Bancilhon, Maier et al. - 1986
118   Unfounded sets and wellfounded semantics for general logic p.. (context) - Van Gelder, Ross et al. - 1988
115   The Alternating Fixpoint of Logic Programs with Negation (context) - Van Gelder - 1989
73   Modular Stratification and Magic Sets for DATALOG Programs w.. (context) - Ross - 1990
67   Negation as Failure Using Tight Derivations for General Logi.. (context) - Van Gelder - 1986
54   the declarative semantics of stratified deductive databases (context) - Przymusinski - 1988
50   Bottom-up beats top-down for Datalog (context) - Ullman - 1989
50   A Generalization of the Differential Approach to Recursive Q.. (context) - Balbin, Ramamohanarao - 1987
42   Naive evaluation of recursively defined relations (context) - Bancilhon - 1985
28   Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Prog.. - Ramakrishnan, Srivastava et al. - 1990
25   Design overview of the Aditi deductive database system (context) - Vaghani, Ramamohanarao et al. - 1991
20   Efficient bottom-up computation of queries on stratified dat.. (context) - Balbin, Port et al.
8   and Ramakrishnan (context) - Beeri - 1987
8   Efficient query answering on stratified databases (context) - Kerisit, Pugin - 1988
6   Magic implementation of stratified programs (context) - Beeri, Ramakrishnan et al.
6   Magic set computations for stratified databases (context) - Balbin, Port et al. - 1987
1   An efficient labelling algorithm for magic set computation o.. (context) - Balbin, Meenakshi et al. - 1988
1   The expressive power of stratified programs Manuscript (context) - Kolaitis - 1987



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