Models David B. Kemp Divesh Srivastava Peter J. Stuckey  Home/Search
Context Related
| att.com/~divesh/pa...s95wfnjournal.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/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a bottom-up operational procedure for computing well-founded models of allowed 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 and various program transformations. (Update)
Context of citations to this paper: More
...duplicated facts, and the memoization of intermediate results. As examples, we have the transformations called Generalized Magis Sets [5, 12], Generalized Supplementary Magic Sets [5] Magic Templates [19] Alexander Templates [24] Counting Methods [23] and recently Induced...
.... to the computation of well founded models based on the alternating fixpoint operator introduced by Van Gelder [16] have been proposed in [10, 15], while in [5, 6] the computation is based on the residual program suggested by [7, 8] Despite of the advantages of the residual...
Cited by: More
Partial Stable Models for Logic Programs with Aggregates - Pelov, Denecker, Bruynooghe (2004) (Correct)
Soft Stratification for Magic Set Based Query Evaluation .. - Andreas Behrend.. (Correct)
A Computational Model for Functional Logic Deductive.. -.. (2001) (Correct)
Similar documents (at the sentence level):
77.7%: Bottom-up Evaluation and Query Optimization of.. - Kemp, Srivastava, Stuckey (1995) (Correct)
15.3%: Magic Sets and Bottom-up Evaluation of Well-Founded Models - Kemp, Stuckey (1991) (Correct)
Active bibliography (related documents): More All
0.7: Right-, Left- and Multi-Linear Rule Transformations That.. - David Kemp (1990) (Correct)
0.6: Well-Founded Ordered Search: Goal directed bottom-up.. - Stuckey, Sudarshan (1997) (Correct)
0.6: A Survey of Research on Deductive Database Systems - Ramakrishnan, Ullman (1993) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
Related documents from co-citation: More All
10: The alternating fix-point of logic programs with negation (context) - Van Gelder - 1989
10: The Well-Founded Semantics for General Logic Programs - Van Gelder, Ross et al. - 1991
9: the power of magic - Beeri, Ramakrishnan - 1987
BibTeX entry: (Update)
Kemp, D. B., Srivastava, D., Stuckey, P. J. Bottom-up evaluation and query optimization of well-founded models. Theoretical Computer Science 146 (1995) 145--184. http://citeseer.ist.psu.edu/743254.html More
@article{ kemp95bottomup,
author = "David B. Kemp and Divesh Srivastava and Peter J. Stuckey",
title = "Bottom-up evaluation and query optimization of well-founded models",
journal = "Theoretical Computer Science",
volume = "146",
number = "1--2",
pages = "145--184",
year = "1995",
url = "citeseer.ist.psu.edu/743254.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
234 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
162 The semantics of predicate logic as a programming language (context) - Van Emden, Kowalski - 1976
112 Old resolution with tabulation (context) - Tamaki, Sato - 1986
73 Modular Stratification and Magic Sets for DATALOG Programs w.. (context) - Ross - 1990
63 Query evaluation under the well founded semantics (context) - Chen, Warren - 1993
61 Logic and data bases (context) - Gallaire, Minker - 1978
58 The Alternating Fixpoint of Logic Programs with Negation (context) - Van Gelder - 1989
55 A procedural semantics for well-founded negation in logic pr.. - Ross - 1989
54 the declarative semantics of stratified deductive databases (context) - Przymusinski - 1988
51 Pushing constraint selections - Srivastava, Ramakrishnan - 1992
50 A Generalization of the Differential Approach to Recursive Q.. (context) - Balbin, Ramamohanarao - 1987
50 Bottom-up beats top-down for Datalog (context) - Ullman - 1989
46 Query evaluation in recursive databases: bottom-up and top-d.. (context) - Bry - 1989
45 Extension tables: memo relations in logic programming (context) - Dietrich - 1987
43 A goal oriented approach to computing well founded semantics (context) - Chen, Warren - 1992
42 Naive evaluation of recursively defined relations (context) - Bancilhon - 1985
38 The stable model semantics for logic programs (context) - Gelfond, Lifschitz - 1988
34 Controlling the Search in Bottomup Evaluation - Ramakrishnan, Srivastava et al. - 1992
31 Magic sets and bottom-up evaluation of wellfounded models - Kemp, Stuckey et al. - 1991
28 Negation as Failure Using Tight Derivations for General Logi.. (context) - Van Gelder - 1986
28 Rule Ordering Bottom-Up Fixpoint Evaluation of Logic Program.. - Ramakrishnan, Srivastava et al. - 1990
26 Efficient evaluation of right (context) - Naughton, Ramakrishnan et al. - 1989
26 An alternating fixpoint tailored to magic programs (context) - Morishita - 1993
25 Design overview of the Aditi deductive database system (context) - Vaghani, Ramamohanarao et al. - 1991
21 Argument reduction by factoring (context) - Naughton, Ramakrishnan et al. - 1989
20 Efficient bottom-up computation of queries on stratified dat.. (context) - Balbin, Port et al. - 1991
20 Propagating constraints in recursive deductive databases - Kemp, Ramamohanarao et al. - 1989
16 An evaluation procedure for all logic programs (context) - Bidoit, Legay - 1990
15 a Vu in Fixpoints of Logic Programs (context) - Maher, Ramakrishnan - 1989
14 Strict completion of logic programs (context) - Drabent, Martelli - 1991
14 From QSQ towards QoSaQ: global optimization of recursive que.. (context) - Vieille - 1988
14 Computation and Implementation of Non-monotonic deductive da.. (context) - Bell, Nerode et al. - 1991
12 and multi-linear rule transformations that maintain context .. (context) - Kemp, Ramamohanarao et al. - 1990
9 Safe computation of the well-founded semantics of DATALOG qu.. (context) - Leone, Rullo - 1992
9 Analysis based constraint query optimization (context) - Kemp, Stuckey - 1993
8 Efficient query answering on stratified databases (context) - Kerisit, Pugin - 1988
8 and Ramakrishnan (context) - Beeri - 1987
7 A query independent method for magic set computation on stra.. (context) - Balbin, Meenakshi et al. - 1988
6 Magic set computations for stratified databases (context) - Balbin, Port et al. - 1987
6 Magic implementation of stratified programs (context) - Beeri, Ramakrishnan et al. - 1990
4 Dualities between alternate semantics for logic programming .. (context) - Baral, Subrahmanian - 1991
3 Query restricted bottom-up evaluation in normal form logic (context) - Kemp, Stuckey et al. - 1992
2 The expressive power of stratified programs Inf (context) - Kolaitis - 1991
2 and Ramakrishnan (context) - Mumick, Finkelstein et al. - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://public.research.att.com/~divesh/papers/): More
Diamond in the Rough: Finding Hierarchical Heavy.. - Cormode, Korn.. (2004) (Correct)
Explaining Program Execution in Deductive Systems - Arora, Ramakrishnan, Roth.. (1993) (Correct)
Using LDAP Directory Caches - Cluet, Kapitskaia, Srivastava (1999) (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