1. Molham Aref, Balder ten Cate, Todd J. Green, Benny Kimelfeld, Dan Olteanu, Emir Pasalic, Todd L. Veldhuizen & Geoffrey Washburn (2015): Design and Implementation of the LogicBlox System. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. ACM, pp. 1371–1382, doi:10.1145/2723372.2742796. Available at
  2. Francois Bancilhon, David Maier, Yehoshua Sagiv & Jeffrey D. Ullman (1986): Magic Sets and Other Strange Ways to Implement Logic Programs. In: Proc. of the 5th ACM Symp. on Principles of Database Systems (PODS'86). ACM Press, pp. 1–15, doi:10.1145/6012.15399.
  3. Catril Beeri & Raghu Ramakrishnan (1987): On the Power of Magic. In: Proc. of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'87). ACM, pp. 269–284, doi:10.1145/28659.28689.
  4. Stefan Brass (2000): SLDMagic — The Real Magic (with Applications to Web Queries).. In: W. Lloyd: First International Conference on Computational Logic (CL'2000/DOOD'2000), LNCS 1861. Springer, pp. 1063–1077, doi:10.1007/3-540-44957-4_71. Available at
  5. Stefan Brass (2010): Implementation Alternatives for Bottom-Up Evaluation. In: Manuel Hermenegildo & Torsten Schaub: Technical Communications of the 26th International Conference on Logic Programming (ICLP'10), Leibniz International Proceedings in Informatics (LIPIcs) 7. Schloss Dagstuhl, pp. 44–53, doi:10.4230/LIPIcs.ICLP.2010.44. Available at
  6. Stefan Brass (2012): Order in Datalog with Applications to Declarative Output. In: Pablo Barceló & Reinhard Pichler: Datalog in Academica and Industry, 2nd Int. Workshop, Datalog 2.0, LNCS 7494. Springer-Verlag, pp. 56–67, doi:10.1007/978-3-642-32925-8_7. Available at
  7. Stefan Brass & Heike Stephan (2015): Bottom-Up Evaluation of Datalog: Preliminary Report. In: Sibylle Schwarz & Steffen Hölldobler: 29th Workshop on (Constraint) Logic Programming (WLP 2015). HTWK Leipzig, pp. 21–35. Available at
  8. Weidong Chen & David S. Warren (1996): Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM 43(1), pp. 20–74, doi:10.1145/227595.227597.
  9. Vítor Santos Costa (1999): Optimizing Bytecode Emulation for Prolog. In: Gopalan Nadathur: Principles and Practice of Declarative Programming, International Conference PPDP'99, LNCS 1702. Springer, pp. 261–277, doi:10.1007/10704567_16.
  10. Vítor Santos Costa, Ricardo Rocha & Luís Damas (2012): The YAP Prolog System. Theory and Practice of Logic Programming 12(1–2), pp. 5–34, doi:10.1017/S1471068411000512. Available at
  11. Pascal Hitzler, Markus Krötzsch, Sebastian Rudolph & Tuvshintur Tserendorj (2008): Approximate OWL Instance Retrieval with SCREECH. In: Anthony G. Cohn, David C. Hogg, Möller. Ralf & Bernd Neumann: Logic and Probability for Scene Interpretation, Dagstuhl Seminar Proceedings 08091. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, Dagstuhl, Germany, pp. 1–8. Available at
  12. Viktor Leis, Alfons Kemper & Thomas Neumann (1997): The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases. In: Proc. of the 2013 IEEE International Conference on Data Engineering (ICDE'2013). IEEE Computer Society, pp. 38–49, doi:10.1109/ICDE.2013.6544812. Available at
  13. Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri & Francesco Scarcello (2006): The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Logic 7(3), pp. 499–562, doi:10.1145/1149114.1149117. Available at
  14. Senlin Liang, Paul Fodor, Hui Wan & Michael Kifer (2009): OpenRuleBench: An Analysis of the Performance of Rule Engines. In: Proceedings of the 18th International Conference on World Wide Web (WWW'09). ACM, pp. 601–610, doi:10.1145/1526709.1526790. Available at
  15. Thomas Neumann (2011): Efficiently Compiling Efficient Query Plans for Modern Hardware. Proceedings of the VLDB Endowment 4(9), pp. 539–550, doi:10.14778/2002938.2002940. Available at
  16. Raghu Ramakrishnan, Divesh Srivastava & S. Sudarshan (1994): Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs. IEEE Transactions on Knowledge and Data Engineering 6(4), pp. 501–517, doi:10.1109/69.298169. Available at
  17. Kenneth A. Ross (1991): Modular Acyclicity and Tail Recursion in Logic Programs. In: Proc. of the Tenth ACM SIGACT-SIGMOD-SIGART Symp. on Princ. of Database Systems (PODS'91), pp. 92–101, doi:10.1145/113413.113422.
  18. Konstantinos Sagonas, Terrance Swift & David S. Warren (1994): XSB as an Efficient Deductive Database Engine. In: Richard T. Snodgrass & Marianne Winslett: Proc. of the 1994 ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'94), pp. 442–453, doi:10.1145/191843.191927. Available at
  19. Heribert Schütz (1993): Tupelweise Bottom-up-Auswertung von Logikprogrammen (Tuple-wise bottom-up evaluation of logic programs). TU München.
  20. Praveen Seshadri, Shaun Flisakowski & Seymour Hersh (1996): CORAL: The Inside Story. Shocking Hacks Revealed. Technical Report. Department of Computer Sciences, The University of Wisconsin-Madison. Available at
  21. Donald A. Smith & Mark Utting (1999): Pseudo-Naive Evaluation. In: Australasian Database Conference, pp. 211–223. Available at
  22. Terrance Swift (1999): Tabling for non-monotonic programming. Annals of Mathematics and Artificial Intelligence 25, pp. 201–240, doi:10.1023/A:1018990308362. Available at

Comments and questions to:
For website issues: