A Query Evaluation Method for Stratified Programs Under the Extended CWA

[1]  Suzanne Wagner Dietrich.  Extension tables for recursive query evaluation , 1987 .

[2]  I. G. BONNER CLAPPISON.  Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.

[3]  V. S. Subrahmanian,et al.  Paraconsistent Logic Programming , 1987, Theor. Comput. Sci..

[4]  François Bry,et al.  Query Evaluation in Deductive Databases: Bottom-Up and Top-Down Reconciled , 1990, Data Knowl. Eng..

[5]  Catriel Beeri,et al.  On the power of magic , 1987, J. Log. Program..

[6]  Catriel Beeri,et al.  Optimizing existential datalog queries , 1988, PODS.

[7]  Hamid Pirahesh,et al.  Magic conditions , 1990, PODS.

[8]  Jeffrey D. Ullman,et al.  Bottom-up beats top-down for datalog , 1989, PODS '89.

[9]  David H. D. Warren,et al.  Parsing as Deduction , 1983, ACL.

[10]  Teodor C. Przymusinski.  Every logic program has a natural stratification and an iterated least fixed point model , 1989, PODS.

[11]  Adrian Walker,et al.  Some Practical Properties of Logic Programming Interpreters , 1984, FGCS.

[12]  Teodor C. Przymusinski,et al.  Weakly Perfect Model Semantics for Logic Programs , 1988, ICLP/SLP.

[13]  Yehoshua Sagiv,et al.  Is There Anything Better than Magic? , 1990, NACLP.

[14]  Kotagiri Ramamohanarao,et al.  Right-, left- and multi-linear rule transformations that maintain context information , 1990, VLDB.

[15]  Laurent Vieille,et al.  Recursive Query Processing: The Power of Logic , 1989, Theor. Comput. Sci..

[16]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[17]  Kenneth A. Ross,et al.  Modular stratification and magic sets for Datalog programs with negation , 1994, JACM.

[18]  David B. Kemp,et al.  Completeness of a Top-Down Query Evaluation Procedure for Stratified Databases , 1988, ICLP/SLP.

[19]  Carlo Zaniolo,et al.  The Generalized Counting Method for Recursive Logic Queries , 1986, Theor. Comput. Sci..

[20]  Udi Manber,et al.  Introduction to algorithms - a creative approach , 1989 .

[21]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[22]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[23]  Carlo Zaniolo,et al.  The LDL System Prototype , 1990, IEEE Trans. Knowl. Data Eng..

[24]  Saumya K. Debray,et al.  Functional computations in logic programs , 1989, TOPL.

[25]  Hamid Pirahesh,et al.  The Magic of Duplicates and Aggregates , 1990, VLDB.

[26]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[27]  Kenneth A. Ross,et al.  Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.