The DOI matches its Crossref record; 78 of the 78 references it cites were found in a registry or an index.
Logic and Databases: A Deductive Approach
Abstract
The purpose of this paper is to show that logic provides a convenient formalism for studying classical database problems. There are two main parts to the paper, devoted respectively to conventional databases and deductive databases. In the first part, we focus on query languages, integrity modeling and maintenance, query optimization, and data
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
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Proceedings of the 19th International Joint Conference on Artificial Intelligence
Pujol, J. M., Delgado, J., Ramon Sangüesa, A., & Flache, A. (2005) · International Joint Conference on Artificial Intelligence · Cited by 5,771
A relational model of data for large shared data banks
Codd, E. F. (1970) · Communications of the ACM · doi:10.1145/362384.362685 · Cited by 5,547
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,909
Introduction to Database Systems
(2006) · Foundations of Database Design · doi:10.1201/9781420003345.ch1 · Cited by 3,521
2009 International Joint Conference on Artificial Intelligence
(2009) · doi:10.1109/jcai15434.2009 · Cited by 2,800
A Mathematical Introduction to Logic
(2001) · Elsevier eBooks · doi:10.1016/c2009-0-22107-6 · Cited by 2,387
Access path selection in a relational database management system
Selinger, P. G., Astrahan, M. M., Chamberlin, D. D., Lorie, R. A., & Price, T. G. (1979) · Proceedings of the 1979 ACM SIGMOD international conference on Management of data - SIGMOD '79 · doi:10.1145/582095.582099 · Cited by 2,188
Circumscription—A form of non-monotonic reasoning
McCarthy, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90011-9 · Cited by 2,017
Clark, K. L. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,000
Cited by
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
Knowledge Representation and Reasoning
(2024) · Encyclopedia of Computer Graphics and Games · doi:10.1007/978-3-031-23161-2_300700 · Cited by 819
Telos: representing knowledge about information systems
Mylopoulos, J., Borgida, A., Jarke, M., & Koubarakis, M. (1990) · ACM Transactions on Information Systems · doi:10.1145/102675.102676 · Cited by 786
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
Reasoning about naming systems
Bowman, M., Debray, S. K., & Peterson, L. L. (1993) · ACM Transactions on Programming Languages and Systems · doi:10.1145/161468.161471 · Cited by 402
Data-driven discovery of quantitative rules in relational databases
Han, J., Cai, Y., & Cercone, N. (1993) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.204089 · Cited by 380
Algorithms for the maximum satisfiability problem
Hansen, P., & Jaumard, B. (1990) · Computing · doi:10.1007/bf02241270 · Cited by 360
Types and persistence in database programming languages
Atkinson, M. P., & Buneman, O. P. (1987) · ACM Computing Surveys · doi:10.1145/62070.45066 · Cited by 344
Eder, J. (1992) · Lecture Notes in Computer Science · doi:10.1007/3-540-55681-8_32 · Cited by 323
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
TEAM: An experiment in the design of transportable natural-language interfaces
Grosz, B. J., Appelt, D. E., Martin, P. A., & Pereira, F. C. N. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90011-7 · Cited by 264
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
A basis for deductive database systems
Lloyd, J. W., & Topor, R. W. (1985) · The Journal of Logic Programming · doi:10.1016/0743-1066(85)90013-5 · Cited by 91
A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering
Chou, S.-C., Gao, X.-S., & Zhang, J.-Z. (2000) · Journal of Automated Reasoning · doi:10.1023/a:1006171315513 · Cited by 89
Fifty Years of Prolog and Beyond
KÖRNER, P., LEUSCHEL, M., BARBOSA, J., COSTA, V. S., DAHL, V., HERMENEGILDO, M. V., MORALES, J. F., WIELEMAKER, J., DIAZ, D., ABREU, S., et al. (2022) · Theory and Practice of Logic Programming · doi:10.1017/s1471068422000102 · Cited by 40
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
- Authors
- Gallaire, H., Minker, J., & Nicolas, J.-M.
- Venue
- ACM Computing Surveys
- Published
- 1984-06
- Volume
- 16
- Issue
- 2
- Pages
- 153-185
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2092842298
- Cited by
- 733
- References
- 78
- FWCI
- 62.83
- 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.