MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Magic Sets and Bottom-up Evaluation of Well-Founded Models (1991) [32 citations — 10 self]

by David B. Kemp ,  Peter J. Stuckey ,  Divesh Srivastava
In Vijay Saraswat and Kazunori Ueda, editors, Proceedings of the 1991 Int. Symposium on Logic Programming
Add To MetaCart

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 strictly subsume those already considered in the literature, and include stratified programs (with any choice of sips), modularly stratified programs (with left-to-right sips) and programs with three-valued well-founded models (with well-founded sips). For these programs and sips, our procedure for computing well-founded models is applicable to the magic programs, thus allowing increased efficiency by specializing a program for a query. 1 Introduction Much research has been done in recent year...

Citations

542 Towards a Theory of Declarative Knowledge – Apt, Blair, et al. - 1988
246 Magic sets and other strange ways to implement logic programs – Bancilhon, Maier, et al. - 1986
205 On the power of magic – BEERI, R - 1987
196 Unfounded Sets and Well-Founded Semantics for General Logic Programs – Gelder, Ross, et al. - 1988
177 The Alternating Fixpoint of Logic Programs with Negation – Gelder - 1993
116 Negation as failure using tight derivations for general logic programs – Gelder - 1988
89 Modular stratification and magic sets for datalog programs with negation – Ross
87 Foundations of Logic Programming. Second, extended edition – Lloyd - 1987
62 Bottom-up beats top-down for datalog – Ullman - 1989
61 On the declarative semantics of stratified deductive databases and logic programs – Przymusinski - 1988
56 A generalization of the differential approach to recursive query evaluation – Balbin, Ramamohanarao - 1987
42 Naïve evaluation of recursively defined relations – Bancilhon - 1985
38 Rule ordering in bottom-up fixpoint evaluation of logic programs – Ramakrishnan, Srivastava, et al. - 1990
32 Design overview of the Aditi deductive database system – Vaghani, Ramamohanarao, et al. - 1991
20 Efficient bottom-up computation of queries on stratified databases – Balbin, Port, et al.
13 Efficient query answering on stratified databases – Kerisit, Pugin - 1988
7 Magic set computations for stratified databases – Balbin, Port, et al. - 1987
5 Magic implementation of stratified programs – Beeri, Ramakrishnan, et al. - 1990
2 An efficient labelling algorithm for magic set computation on stratified databases – Balbin, Meenakshi, et al. - 1988
1 The expressive power of stratified programs Manuscript – Kolaitis - 1987
View or Download | Add to My Collection | Correct Errors