Serge Abiteboul, Richard Hull & Victor Vianu (1995):
Foundations of Databases.
Addison-Wesley.
Mario Alviano, Francesco Calimeri, Carmine Dodaro, Davide Fuscà, Nicola Leone, Simona Perri, Francesco Ricca, Pierfrancesco Veltri & Jessica Zangari (2017):
The ASP system DLV2.
In: International Conference on Logic Programming and Nonmonotonic Reasoning.
Springer,
pp. 215–221,
doi:10.1007/978-3-319-61660-5_19.
Mario Alviano, Wolfgang Faber, Gianluigi Greco & Nicola Leone (2012):
Magic sets for disjunctive Datalog programs.
Artificial Intelligence 187,
pp. 156–192,
doi:10.1016/j.artint.2012.04.008.
Isaac Balbin, Graeme S. Port, Kotagiri Ramamohanarao & Krishnamurthy Meenakshi (1991):
Efficient Bottom-Up Computation of Queries on Stratified Databases.
J. Log. Program. 11(3&4),
pp. 295–344,
doi:10.1016/0743-1066(91)90030-S.
François Bancilhon, David Maier, Yehoshua Sagiv & Jeffrey D. Ullman (1986):
Magic Sets and Other Strange Ways to Implement Logic Programs.
In: Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 24-26, 1986, Cambridge, Massachusetts, USA,
pp. 1–15,
doi:10.1145/6012.15399.
Catriel Beeri & Raghu Ramakrishnan (1991):
On the Power of Magic.
J. Log. Program. 10(3&4),
pp. 255–299,
doi:10.1016/0743-1066(91)90038-Q.
K. Berman, J. Schlipf & J. Franco (1995):
Computing the well-founded semantics faster.
In: Proceedings of the 3rd International Conference on Logic Programming and Nonmonotonic Reasoning,
pp. 113–126,
doi:10.1007/3-540-59487-6_9.
Stefan Brass, Jürgen Dix, Burkhard Freitag & Ulrich Zukowski (2001):
Transformation-based bottom-up computation of the well-founded model.
TPLP 1(5),
pp. 497–538,
doi:10.1017/S147106840100103X.
Andrea Calì, Georg Gottlob & Thomas Lukasiewicz (2012):
A general Datalog-based framework for tractable query answering over ontologies.
J. Web Sem. 14,
pp. 57–83,
doi:10.1016/j.websem.2012.03.001.
Weidong Chen & David Scott Warren (1996):
Tabled Evaluation With Delaying for General Logic Programs.
J. ACM 43(1),
pp. 20–74,
doi:10.1145/227595.227597.
John DeTreville (2002):
Binder, a Logic-Based Security Language.
In: Proc. of the 2002 IEEE Symp. on Security and Privacy (S&P),
pp. 105–113,
doi:10.1109/SECPRI.2002.1004365.
Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub & Marius Thomas Schneider (2011):
Potassco: The Potsdam Answer Set Solving Collection.
AI Commun. 24(2),
pp. 107–124,
doi:10.3233/AIC-2011-0491.
Allen Van Gelder, Kenneth A. Ross & John S. Schlipf (1991):
The Well-Founded Semantics for General Logic Programs.
J. ACM 38(3),
pp. 620–650,
doi:10.1145/116825.116838.
Michael Gelfond & Vladimir Lifschitz (1988):
The Stable Model Semantics for Logic Programming.
In: Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, USA, August 15-19, 1988 (2 Volumes),
pp. 1070–1080.
David B. Kemp, Divesh Srivastava & Peter J. Stuckey (1995):
Bottom-Up Evaluation and Query Optimization of Well-Founded Models.
Theor. Comput. Sci. 146(1&2),
pp. 145–184,
doi:10.1016/0304-3975(94)00153-A.
Yanhong A. Liu & Scott D. Stoller (2009):
From Datalog rules to efficient programs with time and space guarantees.
ACM Trans. Program. Lang. Syst. 31(6),
doi:10.1145/1552309.1552311.
Yanhong A. Liu & Scott D. Stoller (2018):
Founded Semantics and Constraint Semantics of Logic Rules.
In: Proc. of the 2018 Intl. Symp. on Logical Foundations of Computer Science.
Springer,
pp. 221–241,
doi:10.1007/978-3-319-72056-2_14.
Boon Thau Loo (2009):
Declarative networking.
Commun. ACM 52(11),
pp. 87–95,
doi:10.1145/1592761.1592785.
David Maier, K. Tuncay Tekle, Michael Kifer & David S. Warren (2018):
Declarative Logic Programming, chapter Datalog: Concepts, History, and Outlook.
ACM, Morgan & Claypool,
New York, NY,
pp. 3–100,
doi:10.1145/3191315.3191317.
Michael Meskes & Jörg Noack (1993):
The Generalized Supplementary Magic-Sets Transformation for Stratified Datalog.
Inf. Process. Lett. 47(1),
pp. 31–41,
doi:10.1016/0020-0190(93)90154-2.
Boris Motik, Yavor Nenov, Robert Piro & Ian Horrocks (2019):
Maintenance of datalog materialisations revisited.
Artificial Intelligence 269,
pp. 76–136,
doi:10.1016/j.artint.2018.12.004.
Teodor C. Przymusinski (1989):
On the Declarative and Procedural Semantics of Logic Programs.
J. Autom. Reasoning 5(2),
pp. 167–205,
doi:10.1007/BF00243002.
Prasad Rao, C. R. Ramakrishnan & I. V. Ramakrishnan (1996):
A Thread in Time Saves Tabling Time.
In: JICSLP,
pp. 112–126.
Kenneth A. Ross (1994):
Modular Stratification and Magic Sets for Datalog Programs with Negation.
J. ACM 41(6),
pp. 1216–1266,
doi:10.1145/195613.195646.
Damien Sereni, Pavel Avgustinov & Oege de Moor (2008):
Adding magic to an optimising datalog compiler.
In: SIGMOD Conference,
pp. 553–566,
doi:10.1145/1376616.1376673.
Hisao Tamaki & Taisuke Sato (1986):
OLD Resolution with Tabulation.
In: Proc. of the 3rd Intl. Conf. on Logic Programming (ICLP),
pp. 84–98,
doi:10.1007/3-540-16492-8_66.
K. Tuncay Tekle & Yanhong A. Liu (2010):
Precise complexity analysis for efficient datalog queries.
In: Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 26-28, 2010, Hagenberg, Austria,
pp. 35–44,
doi:10.1145/1836089.1836094.
K. Tuncay Tekle & Yanhong A. Liu (2011):
More efficient datalog queries: subsumptive tabling beats magic sets.
In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, Athens, Greece, June 12-16, 2011,
pp. 661–672,
doi:10.1145/1989323.1989393.
David S. Warren & Yanhong A. Liu (2017):
AppLP: A Dialogue on Applications of Logic Programming.
Computing Research Repository arXiv:1704.02375 [cs.PL].
Jan Wielemaker, Tom Schrijvers, Markus Triska & Torbjörn Lager (2012):
SWI-Prolog.
TPLP 12(1-2),
pp. 67–96,
doi:10.1017/S1471068411000494.
eptcs@eptcs.org