Foundations of Deductive Databases and Logic Programming
The DOI matches its Crossref record.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Constraint logic programming: a survey
Jaffar, J., & Maher, M. J. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90033-7 · Cited by 1,312
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
The DLV system for knowledge representation and reasoning
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., & Scarcello, F. (2006) · ACM Transactions on Computational Logic · doi:10.1145/1149114.1149117 · Cited by 1,151
Extending and implementing the stable model semantics
Simons, P., Niemelä, I., & Soininen, T. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00187-x · Cited by 841
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
What you always wanted to know about Datalog (and never dared to ask)
Ceri, S., Gottlob, G., & Tanca, L. (1989) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.43410 · Cited by 700
An abstract, argumentation-theoretic approach to default reasoning
Bondarenko, A., Dung, P. M., Kowalski, R. A., & Toni, F. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00015-5 · Cited by 665
Flexible support for multiple access control policies
Jajodia, S., Samarati, P., Sapino, M. L., & Subrahmanian, V. S. (2001) · ACM Transactions on Database Systems · doi:10.1145/383891.383894 · Cited by 640
DERSHOWITZ, N., & JOUANNAUD, J.-P. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50011-1 · Cited by 579
On the Declarative Semantics of Deductive Databases and Logic Programs
Przymusinski, T. C. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50009-9 · Cited by 548
The family of concurrent logic programming languages
Shapiro, E. (1989) · ACM Computing Surveys · doi:10.1145/72551.72555 · Cited by 440
Logic programming and knowledge representation
Baral, C., & Gelfond, M. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90025-6 · Cited by 431
Logic programming and negation: A survey
Apt, K. R., & Bol, R. N. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90024-8 · Cited by 412
A general Datalog-based framework for tractable query answering over ontologies
Calì, A., Gottlob, G., & Lukasiewicz, T. (2012) · Journal of Web Semantics · doi:10.1016/j.websem.2012.03.001 · Cited by 407
On the computational cost of disjunctive logic programming: Propositional case
Eiter, T., & Gottlob, G. (1995) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01536399 · Cited by 376
F-logic: a higher-order language for reasoning about objects, inheritance, and scheme
Kifer, M., & Lausen, G. (1989) · ACM SIGMOD Record · doi:10.1145/66926.66939 · Cited by 356
Conflict-driven answer set solving: From theory to practice
Gebser, M., Kaufmann, B., & Schaub, T. (2012) · Artificial Intelligence · doi:10.1016/j.artint.2012.04.001 · Cited by 327
Answer Set Solving in Practice
Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. H. (2012) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00457ed1v01y201211aim019 · Cited by 288
Elements of Relational Database Theory
KANELLAKIS, P. C. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50022-6 · Cited by 259
Artëmov, S. (1994) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(94)90007-8 · Cited by 135
(1993) · Lirias · Cited by 108
Narrowing-driven partial evaluation of functional logic programs
Alpuente, M., Falaschi, M., & Vidal, G. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61055-3_28 · Cited by 40
Creating specialised integrity checks through partial evaluation of meta-interpreters
Leuschel, M., & De Schreye, D. (1998) · The Journal of Logic Programming · doi:10.1016/s0743-1066(97)10012-7 · Cited by 29
Why untyped nonground metaprogramming is not (much of) a problem
Martens, B., & de Schreye, D. (1995) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)00015-x · Cited by 23
A new method for integrity constraint checking in deductive databases
Seljée, R. (1995) · Data & Knowledge Engineering · doi:10.1016/0169-023x(94)00032-a · Cited by 14
Metadata
- Venue
- Elsevier eBooks
- Publisher
- Elsevier
- Published
- 1988
- OpenAlex
- W2065555531
- Cited by
- 974
- References
- 0
- FWCI
- 24.93
- Type
- book
- 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.