The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
What you always wanted to know about Datalog (and never dared to ask)
Abstract
Datalog, a database query language based on the logic programming paradigm, is described. The syntax and semantics of Datalog and its use for querying a relational database are presented. Optimization methods for achieving efficient evaluations of Datalog queries are classified, and the most relevant methods are presented. Various improvements of Datalog currently under study are discussed, and what is still needed in order to extend Datalog's applicability to the solution of real-life problems is indicated.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Foundations of Logic Programming
Lloyd, J. W. (1984) · Springer eBooks · doi:10.1007/978-3-642-96826-6 · Cited by 4,128
Foundations of Logic Programming
Lloyd, J. W. (1987) · Springer eBooks · doi:10.1007/978-3-642-83189-8 · Cited by 2,736
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (1931) · Monatshefte für Mathematik und Physik · doi:10.1007/bf01700692 · Cited by 2,395
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (2006) · Monatshefte für Mathematik · doi:10.1007/s00605-006-0423-7 · Cited by 2,077
Clark, K. L. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,000
Warshall, S. (1962) · Journal of the ACM · doi:10.1145/321105.321107 · Cited by 1,683
The well-founded semantics for general logic programs
Van Gelder, A., Ross, K. A., & Schlipf, J. S. (1991) · Journal of the ACM · doi:10.1145/116825.116838 · Cited by 1,652
Foundations of logic programming; (2nd extended ed.)
Lloyd, J. W. (1987) · Springer eBooks · Cited by 1,501
Symbolic Logic and Mechanical Theorem Proving
(1973) · Elsevier eBooks · doi:10.1016/c2009-0-22103-9 · Cited by 1,468
The Semantics of Predicate Logic as a Programming Language
Van Emden, M. H., & Kowalski, R. A. (1976) · Journal of the ACM · doi:10.1145/321978.321991 · Cited by 1,449
(1988) · Computer Science Press, Inc. eBooks · Cited by 1,435
Towards a Theory of Declarative Knowledge
Apt, K. R., Blair, H. A., & Walker, A. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50006-3 · Cited by 1,151
Sterling, L., Shapiro, E., & Garrett, R. (1987) · IEEE Expert · doi:10.1109/mex.1987.4307074 · Cited by 1,101
Foundations of Deductive Databases and Logic Programming
(1988) · Elsevier eBooks · doi:10.1016/c2013-0-07699-2 · Cited by 974
Logic Programming and Databases
Ceri, S., Gottlob, G., & Tanca, L. (1990) · Surveys in Computer Science · doi:10.1007/978-3-642-83952-8 · Cited by 747
Self-citationAn amateur's introduction to recursive query processing strategies
Bancilhon, F., & Ramakrishnan, R. (1986) · ACM SIGMOD Record · doi:10.1145/16856.16859 · Cited by 698
Automated Theorem Proving: A Logical Basis
Loveland, D. W. (1978) · Medical Entomology and Zoology · Cited by 667
Die Vollständigkeit der Axiome des logischen Funktionenkalküls
Gödel, K. (1930) · Monatshefte für Mathematik und Physik · doi:10.1007/bf01696781 · Cited by 635
Die Widerspruchsfreiheit der reinen Zahlentheorie
Gentzen, G. (1936) · Mathematische Annalen · doi:10.1007/bf01565428 · Cited by 614
Contributions to the Theory of Logic Programming
Apt, K. R., & van Emden, M. H. (1982) · Journal of the ACM · doi:10.1145/322326.322339 · Cited by 585
Gallaire, H., & Minker, J. (1978) · Medical Entomology and Zoology · Cited by 559
A kripke-kleene semantics for logic programs*
Fitting, M. (1985) · The Journal of Logic Programming · doi:10.1016/s0743-1066(85)80005-4 · Cited by 534
Kunen, K. (1987) · The Journal of Logic Programming · doi:10.1016/0743-1066(87)90007-0 · Cited by 439
Über Möglichkeiten im Relativkalkül
Löwenheim, L. (1915) · Mathematische Annalen · doi:10.1007/bf01458217 · Cited by 398
Unfounded sets and well-founded semantics for general logic programs
Gelder, A. V., Ross, K. A., & Schlipf, J. S. (1988) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/308386.308444 · Cited by 380
Implementation of logical query languages for databases
Ullman, J. D. (1985) · ACM Transactions on Database Systems · doi:10.1145/3979.3980 · Cited by 373
The alternating fixpoint of logic programs with negation
Van Gelder, A. (1989) · Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/73721.73722 · Cited by 369
Object identity as a query language primitive
Abiteboul, S., & Kanellakis, P. C. (1989) · ACM SIGMOD Record · doi:10.1145/66926.66941 · Cited by 362
Remarks on the algebra of non first normal form relations
Jaeschke, G., & Schek, H. J. (1982) · Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS '82 · doi:10.1145/588111.588133 · Cited by 356
A logical language for data and knowledge bases
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0349 · Cited by 351
Horn clause queries and generalizations
Chandra, A. K., & Harel, D. (1985) · The Journal of Logic Programming · doi:10.1016/0743-1066(85)90002-0 · Cited by 309
A Unification Algorithm for Associative-Commutative Functions
Stickel, M. E. (1981) · Journal of the ACM · doi:10.1145/322261.322262 · Cited by 243
Statistical profile estimation in database systems
Mannino, M. V., Chu, P., & Sager, T. (1988) · ACM Computing Surveys · doi:10.1145/62061.62063 · Cited by 225
Every logic program has a natural stratification and an iterated least fixed point model
Przymusinski, T. C. (1989) · Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/73721.73723 · Cited by 201
Shepherdson, J. C. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50005-1 · Cited by 200
Sagiv, Y. (1988) · Elsevier eBooks · doi:10.1016/b978-0-934613-40-8.50021-x · Cited by 149
Alpha: an extension of relational algebra to express a class of recursive queries
Agrawal, R. (1988) · IEEE Transactions on Software Engineering · doi:10.1109/32.42731 · Cited by 142
LDL: A Logic-Based Data Language
Tsur⋆, S., & Zaniolo, C. (1986) · Very Large Data Bases · Cited by 135
Design overview of the NAIL! System
Morris, K., Ullman, J. D., & Gelder, A. V. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16492-8_104 · Cited by 112
Chandra, A. K. (1988) · Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems · doi:10.1145/308386.308396 · Cited by 97
Kolaitis, P. G., & Papadimitriou, C. H. (1988) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/308386.308446 · Cited by 94
Shepherdson, J. C. (1985) · The Journal of Logic Programming · doi:10.1016/0743-1066(85)90018-4 · Cited by 78
A procedural semantics for well founded negation in logic programs
Ross, K. A. (1989) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/73721.73724 · Cited by 65
Logic programming as constructivism: a formalization and its application to databases
Bry, F. (1989) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/73721.73725 · Cited by 63
An Algorithm for Transitive Closure with Linear Expected Time
Schnorr, C. P. (1978) · SIAM Journal on Computing · doi:10.1137/0207011 · Cited by 62
Data functions, datalog and negation
Abiteboul, S., & Hull, R. B. (1988) · ACM SIGMOD Record · doi:10.1145/971701.50218 · Cited by 60
Controlling recursive inference
Smith, D. E., Genesereth, M., & Ginsberg, M. L. (1986) · Artificial Intelligence · doi:10.1016/0004-3702(86)90003-2 · Cited by 54
Optimizing existential datalog queries
Ramakrishnan, R., Beeri, C., & Krishnamurthy, R. (1988) · Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems · doi:10.1145/308386.308420 · Cited by 42
An algorithm for ordering subgoals in NAIL?
Morris, K. A. (1988) · Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems · doi:10.1145/308386.308419 · Cited by 39
Data models and languages for databases
Beeri, C. (1983) · Lecture notes in computer science · doi:10.1007/3-540-50171-1_2 · Cited by 34
Efficient database access from Prolog
Ceri, S., Gottlob, G., & Wiederhold, G. C. M. (1989) · IEEE Transactions on Software Engineering · doi:10.1109/32.21742 · Cited by 29
Self-citation
Cited by
Hogan, A., Blomqvist, E., Cochez, M., D’amato, C., Melo, G. D., Gutierrez, C., Kirrane, S., Gayo, J. E. L., Navigli, R., Neumaier, S., et al. (2022) · ACM Computing Surveys · doi:10.1145/3447772 · Cited by 1,904
KnowRob: A knowledge processing infrastructure for cognition-enabled robots
Tenorth, M., & Beetz, M. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913481635 · Cited by 388
Malmgren, B., Andreasen, J. O., Flores, M. T., Robertson, A., DiAngelis, A. J., Andersson, L., Cavalleri, G., Cohenca, N., Day, P., Hicks, M. L., et al. (2012) · Dental Traumatology · doi:10.1111/j.1600-9657.2012.01146.x · Cited by 328
Eder, J. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55681-8_32 · Cited by 323
Gutierrez, C., & Sequeda, J. F. (2021) · Communications of the ACM · doi:10.1145/3418294 · Cited by 148
Metadata
- Authors
- Ceri, S., Gottlob, G., & Tanca, L.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 1989-03
- Volume
- 1
- Issue
- 1
- Pages
- 146-166
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2167685423
- Cited by
- 700
- References
- 51
- FWCI
- 9.45
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.