Tabled Logic Programs: Principles, Practice and Applications

[1]  Juliana Freire,et al.  Taking I/O Seriously: Resolution Reconsidered for Disk , 1997, ICLP.

[2]  Juliana Freire,et al.  Beyond Depth-First: Improving Tabled Logic Programs through Alternative Scheduling Strategies , 1996, PLILP.

[3]  Steven Skiena,et al.  Principles and practice of unification factoring , 1996, TOPL.

[4]  Stefan Brass,et al.  SLDMagic - An Improved Magic Set Technique , 1996, ADBIS.

[5]  Konstantinos Sagonas,et al.  An Abstract Machine for Fixed-Order Dynamically Stratified Programs , 1996, CADE.

[6]  Shinichi Morishita,et al.  An Extension of Van Gelder's Alternating Fixpoint to Magic Programs , 1996, J. Comput. Syst. Sci..

[7]  C. R. Ramakrishnan,et al.  Practical program analysis using general purpose logic programming systems—a case study , 1996, PLDI '96.

[8]  David Scott Warren,et al.  The slg-wam: a search-efficient engine for well-founded evaluation of normal logic programs , 1996 .

[9]  K. A. Ross,et al.  Tabled Evaluation with Delaying for General Logic Programs , 1996 .

[10]  Konstantinos Sagonas,et al.  An Abstract Machine for Computing the Well-Founded Semantics , 1996, JICSLP.

[11]  C. R. Ramakrishnan,et al.  A Thread in Time Saves Tabling Time , 1996, JICSLP.

[12]  Luís Moniz Pereira,et al.  Model-based diagnosis preferences and strategies representation with logic meta-programming , 1995 .

[13]  José Júlio Alferes,et al.  Modelling Diagnosis Systems with the Logic Programming , 1995, EPIA.

[14]  Jens E. Wunderwald.  A Portable Implementation of Memoing Evaluation , 1995, PLILP.

[15]  Rui Hu,et al.  Exploiting Parallelism in Tabled Evaluations , 1995, PLILP.

[16]  David Scott Warren,et al.  Efficient Top-Down Computation of Queries under the Well-Founded Semantics , 1995, J. Log. Program..

[17]  Thomas W. Reps,et al.  Shape analysis as a generalized path problem , 1995, PEPM '95.

[18]  Jeffrey D. Ullman,et al.  A survey of deductive database systems , 1995, J. Log. Program..

[19]  John W. Lloyd.  Top-Down beats Bottom-Up for Constraint Extensions of Datalog , 1995 .

[20]  I. V. Ramakrishnan,et al.  Efficient Tabling Mechanisms for Logic Programs , 1995, ICLP.

[21]  David Toman,et al.  Top-Down beats Bottom-Up for Constraint Based Extensions of Datalog , 1995, ILPS.

[22]  Gerda Janssens,et al.  A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs , 1995, ILPS.

[23]  Raghu Ramakrishnan.  Applications of Logic Databases , 1995, The Kluwer International Series in Engineering and Computer Science 296.

[24]  C. R. Ramakrishnan,et al.  Optimizing Clause Resolution: Beyond Unification Factoring , 1995, ILPS.

[25]  David Toman.  Top-down Beats Bottom-up for Constraint Extensions of Datalog , 1995 .

[26]  Terrance Swift,et al.  Efficient evaluation of normal logic programs , 1994 .

[27]  Ling Liu,et al.  LogicBase: a deductive database system prototype , 1994, CIKM '94.

[28]  R. Ramesh,et al.  A Portable Method of Integrating SLG Resolution into Prolog Systems , 1994, ILPS.

[29]  José Júlio Alferes,et al.  SLX - A Top-down Derivation Procedure for Programs with Explicit Negation , 1994, ILPS.

[30]  David Scott Warren,et al.  An Abstract Machine for SLG Resolution: Definite Programs , 1994, ILPS.

[31]  Éric Villemonte de la Clergerie,et al.  LPDA: Another look at Tabulation in Logic Programming , 1994, ICLP.

[32]  Scott A. Smolka,et al.  On the parallel complexity of model checking in the modal mu-calculus , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[33]  Ulf Nilsson,et al.  Magic Computation for Wll-founded Semantics , 1994, NMELP.

[34]  Konstantinos Sagonas,et al.  XSB as an efficient deductive database engine , 1994, SIGMOD '94.

[35]  Hamid Pirahesh,et al.  Implementation of magic-sets in a relational database system , 1994, SIGMOD '94.

[36]  Kenneth A. Ross.  Modular Stratification and Magic Sets for Datalog Programs with Negation , 1994, J. ACM.

[37]  David Scott Warren,et al.  Analysis of Sequential SLG Evaluation , 1994 .

[38]  Konstantinos Sagonas,et al.  Xsb as an Eecient Deductive Database Engine , 1994 .

[39]  Frank Teusink,et al.  A Proof Procedure for Extended Logic Programs , 1993, ILPS.

[40]  Sergio Greco,et al.  Dynamic Programming Optimization for Logic Queries with Aggregates , 1993, ILPS.

[41]  Bart Demoen,et al.  Analysing Logic Programs Using 'Prop'-ositional Logic Programs and a Magic Wand , 1993, ILPS.

[42]  Divesh Srivastava,et al.  Extending the Well-Founded and Valid Semantics for Aggregation , 1993, ILPS.

[43]  Roland N. Bol,et al.  Tabulated Resolution for the Well-Founded Semantics , 1993, J. Log. Program..

[44]  S. Sudarshan,et al.  Optimizations of Bottom-Up Evaluation with Non-Ground Terms , 1993, ILPS.

[45]  Alberto O. Mendelzon,et al.  Deductive Database Support for Data Visualization , 1993, EDBT.

[46]  Roland N. Bol,et al.  The Underlying Search for Magic Templates and Tabulation , 1993, ICLP.

[47]  Gerd Wagner.  Reasoning with Inconsistency in Extended Deductive Databases , 1993, LPNMR.

[48]  Shinichi Morishita,et al.  Design and implementation of the glue-nail database system , 1993, SIGMOD Conference.

[49]  José Júlio Alferes,et al.  Diagnosis and Debugging as Contradiction Removal , 1993, LPNMR.

[50]  Divesh Srivastava,et al.  Implementation of the CORAL deductive database system , 1993, SIGMOD Conference.

[51]  Roland N. Bol,et al.  Loop checking in partial deduction , 1993, J. Log. Program..

[52]  Jiawei Han,et al.  Compilation and evaluation of linear mutual recursions , 1993, Inf. Sci..

[53]  Éric Villemonte de la Clergerie,et al.  Layer sharing: an improved structure-sharing framework , 1993, POPL '93.

[54]  Well-founded ordered search , 1993 .

[55]  Tadashi Kanamori.  Abstract Interpretation Based on Alexander Templates , 1993, J. Log. Program..

[56]  Tadashi Kanamori,et al.  Abstract Interpretation based on OLDT Resolution , 1993, J. Log. Program..

[57]  Thomas W. Reps,et al.  Demand Interprocedural Program Analysis Using Logic Databases , 1993, Workshop on Programming with Logic Databases , ILPS.

[58]  Saumya K. Debray,et al.  Global Flow Analysis as a Practical Compilation Tool , 1992, J. Log. Program..

[59]  Inderpal Singh Mumick,et al.  Magic-sets transformation in nonrecursive systems , 1992, PODS '92.

[60]  Suzanne W. Dietrich,et al.  Extension table built‐ins for prolog , 1992, Softw. Pract. Exp..

[61]  Divesh Srivastava,et al.  Controlling the Search in Bottom-Up Evaluation , 1992, JICSLP.

[62]  Hong Gao.  Declarative picture description and interpretation in logic , 1992 .

[63]  Sundararajarao Sundarshan.  Optimizing bottom-up query evaluation for deductive databases , 1992 .

[64]  S. Sudarshan,et al.  Optimizing Bottom-Up Query Evaluation for Deductive Databases , 1992 .

[65]  Michael Gelfond,et al.  Representing Actions in Extended Logic Programming , 1992, JICSLP.

[66]  Carlo Zaniolo,et al.  Compilation of Set Terms in the Logic Data Language (LDL) , 1992, J. Log. Program..

[67]  Laks V. S. Lakshmanan,et al.  Deductive Databases with Incomplete Information , 1992, JICSLP.

[68]  Ling Liu,et al.  Efficient Evaluation of Multiple Linear Recursions , 1991, IEEE Trans. Software Eng..

[69]  Peter J. Stuckey,et al.  Semantics of Logic Programs with Aggregates , 1991, ISLP.

[70]  S. Sudarshan,et al.  Aggregation and Relevance in Deductive Databases , 1991, VLDB.

[71]  Ulf Nilsson,et al.  Abstract Interpretation: A Kind of Magic , 1991, Theor. Comput. Sci..

[72]  Kotagiri Ramamohanarao,et al.  Design overview of the Aditi deductive database system , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[73]  Kenneth A. Ross,et al.  Modular acyclicity and tail recursion in logic programs , 1991, PODS.

[74]  Kenneth A. Ross,et al.  Glue-Nail: a deductive database system , 1991, SIGMOD '91.

[75]  Christine Froidevaux,et al.  Negation by Default and Unstratifiable Logic Programs , 1991, Theor. Comput. Sci..

[76]  Phan Minh Dung,et al.  Negations as Hypotheses: An Abductive Foundation for Logic Programming , 1991, ICLP.

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

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

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

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

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

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

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

[84]  L. Vielle,et al.  Recursive query processing: the power of logic , 1989 .

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

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

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

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

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

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

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

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

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

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

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

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

[97]  Hidenori Itoh,et al.  A Query Evaluation Method for Stratified Programs Under the Extended CWA , 1988, ICLP/SLP.

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

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

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

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

[102]  R. Ramakrishnan,et al.  An amateur's introduction to recursive query processing strategies , 1986, SIGMOD '86.

[103]  David Maier,et al.  Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.

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

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

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

[107]  M. Regula.  Syntactica , 1960, Indogermanische Forschungen.

[108]  Carmen Curcó.  Semántica , 2022 .