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
An Introduction to Mathematical Logic
(2005) · Discrete Algorithmic Mathematics · doi:10.1201/b13782-17 · Cited by 1,732
Extending the database relational model to capture more meaning
Codd, E. F. (1979) · ACM Transactions on Database Systems · doi:10.1145/320107.320109 · Cited by 1,559
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
Optimal implementation of conjunctive queries in relational data bases
Chandra, A. K., & Merlin, P. M. (1977) · Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77 · doi:10.1145/800105.803397 · Cited by 1,224
Kowalski, R., & Smoliar, S. (1982) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1005937.1005947 · Cited by 1,182
The design and implementation of INGRES
Stonebraker, M., Held, G., Wong, E., & Kreps, P. (1976) · ACM Transactions on Database Systems · doi:10.1145/320473.320476 · Cited by 886
Query-by-Example: A data base language
Zloof, M. M. (1977) · IBM Systems Journal · doi:10.1147/sj.164.0324 · Cited by 877
Proceedings of the 27th International Conference on Very Large Data Bases
Apers, P. M. G., Atzeni, P., Ceri, S., Paraboschi, S., Ramamohanarao, K., & Snodgrass, R. T. (2001) · Cited by 845
Multivalued dependencies and a new normal form for relational databases
Fagin, R. (1977) · ACM Transactions on Database Systems · doi:10.1145/320557.320571 · Cited by 712
Automated Theorem Proving: A Logical Basis
Loveland, D. W. (1978) · Medical Entomology and Zoology · Cited by 667
(1979) · Lecture notes in computer science · doi:10.1007/3-540-09237-4 · Cited by 648
Towards a Logical Reconstruction of Relational Database Theory
Reiter, R. (1984) · Topics in information systems · doi:10.1007/978-1-4612-5196-5_8 · Cited by 585
Testing implications of data dependencies
Maier, D., Mendelzon, A. O., & Sagiv, Y. (1979) · ACM Transactions on Database Systems · doi:10.1145/320107.320115 · Cited by 582
Gallaire, H., & Minker, J. (1978) · Medical Entomology and Zoology · Cited by 559
Self-citationStructure and complexity of relational queries
Chandra, A., & Harel, D. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90012-5 · Cited by 534
On semantic issues connected with incomplete information databases
Lipski, W. (1979) · ACM Transactions on Database Systems · doi:10.1145/320083.320088 · Cited by 512
1985 ACM-SIGMOD international conference on management of data
(1985) · Information & Management · doi:10.1016/0378-7206(85)90026-6 · Cited by 485
Computable queries for relational data bases
chandra, A. K., & Harel, D. (1980) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(80)90032-x · Cited by 437
Goldblatt, R. (1986) · Journal of Symbolic Logic · doi:10.2307/2273958 · Cited by 427
Principles of Data Base Systems
Ullman, J. D. (1980) · Cumulative Index of Computer Aided Architectural Design · Cited by 426
A Proof Procedure for Data Dependencies
Beeri, C., & Vardi, M. Y. (1984) · Journal of the ACM · doi:10.1145/1634.1636 · Cited by 415
On Indefinite Data Bases and the Closed World Assumption
Minker, J. (1982) · Medical Entomology and Zoology · Cited by 406
Self-citationOn indefinite databases and the closed world assumption
Minker, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0000066 · Cited by 381
Self-citationHorn clauses and database dependencies
Fagin, R. (1982) · Journal of the ACM · doi:10.1145/322344.322347 · Cited by 380
Equivalences among Relational Expressions
Aho, A. V., Sagiv, Y., & Ullman, J. D. (1979) · SIAM Journal on Computing · doi:10.1137/0208017 · Cited by 365
Relational database: a practical foundation for productivity
Codd, E. F. (1982) · Communications of the ACM · doi:10.1145/358396.358400 · Cited by 351
On the semantics of updates in databases
Fagin, R., Ullman, J. D., & Vardi, M. Y. (1983) · ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS) · doi:10.1145/588058.588100 · Cited by 338
Linear Resolution with Selection Function
Kowalski, R., & Kuehner, D. (1983) · Automation of Reasoning · doi:10.1007/978-3-642-81955-1_32 · Cited by 316
Hewitt, C. E. (1972) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 314
Logic for improving integrity checking in relational data bases?
Nicolas, J.-M. (1982) · Acta Informatica · doi:10.1007/bf00263192 · Cited by 307
Self-citationDeciding Combinations of Theories
Shostak, R. E. (1984) · Journal of the ACM · doi:10.1145/2422.322411 · Cited by 298
A history and evaluation of System R
Chamberlin, D. D., Astrahan, M. M., Blasgen, M. W., Gray, J. N., King, W. F., Lindsay, B. G., Lorie, R., Mehl, J. W., Price, T. G., Putzolu, F., et al. (1981) · Communications of the ACM · doi:10.1145/358769.358784 · Cited by 273
Linear resolution with selection function
Kowalski, R., & Kuehner, D. (1971) · Artificial Intelligence · doi:10.1016/0004-3702(71)90012-9 · Cited by 259
Circumscription—A Form of Non-Monotonic Reasoning
McCarthy, J. (1981) · Readings in Artificial Intelligence · doi:10.1016/b978-0-934613-03-3.50036-2 · Cited by 228
Equality and Domain Closure in First-Order Databases
Reiter, R. (1980) · Journal of the ACM · doi:10.1145/322186.322189 · Cited by 168
Deductive Question-Answering on Relational Data Bases
Reiter, R. (1978) · Springer eBooks · doi:10.1007/978-1-4684-3384-5_6 · Cited by 161
Normalization and hierarchical dependencies in the relational data model
Delobel, C. (1978) · ACM Transactions on Database Systems · doi:10.1145/320263.320271 · Cited by 156
A sound and sometimes complete query evaluation algorithm for relational databases with null values
Reiter, R. (1986) · Journal of the ACM · doi:10.1145/5383.5388 · Cited by 156
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
Sagiv, Y., Delobel, C., Parker, D., et al. (1981) · Journal of the ACM · doi:10.1145/322261.322263 · Cited by 153
An Overview of Knowledge Representation
Mylopoulos, J., & Levesque, H. J. (1983) · Informatik-Fachberichte · doi:10.1007/978-3-642-69391-5_13 · Cited by 152
A linear format for resolution
Loveland, D. W. (1970) · Lecture notes in mathematics · doi:10.1007/bfb0060630 · Cited by 124
Kowalski, R. (1978) · Springer eBooks · doi:10.1007/978-1-4684-3384-5_4 · Cited by 122
Embedded implicational dependencies and their inference problem
Chandra, A. K., Lewis, H. R., & Makowsky, J. A. (1981) · doi:10.1145/800076.802488 · Cited by 117
Theorem-Proving by Resolution as a Basis for Question-Answering Systems
Green, C. (2010) · Cited by 116
Integrity Checking in Deductive Data Bases
Nicolas, J. M., & Yazdanian, K. (1978) · Springer eBooks · doi:10.1007/978-1-4684-3384-5_12 · Cited by 114
Self-citationA Formal Approach to Null Values in Database Relations
Biskup, J. (1981) · Springer eBooks · doi:10.1007/978-1-4615-8297-7_11 · Cited by 105
An Overview of Knowledge Representation
Mylopoulos, J., & Levesque, H. J. (1980) · Topics in information systems · doi:10.1007/978-1-4612-5196-5_1 · Cited by 97
Jacobs, B. E. (1982) · Journal of the ACM · doi:10.1145/322307.322310 · Cited by 92
Completeness of the negation as failure rule
Jaffar, J., Lassez, J.-L., & Lloyd, J. W. (1983) · Cited by 87
On the completeness of query languages for relational data bases
Bancilhon, F. (1978) · Lecture notes in computer science · doi:10.1007/3-540-08921-7_60 · Cited by 87
On the expressive power of the relational algebra
Paredaens, J. (1978) · Information Processing Letters · doi:10.1016/0020-0190(78)90055-8 · Cited by 86
Circumscription implies predicate completion (sometimes)
Reiter, R. (1982) · National Conference on Artificial Intelligence · Cited by 79
On database systems development through logic
Dahl, V. (1982) · ACM Transactions on Database Systems · doi:10.1145/319682.319700 · Cited by 73
On recursive axioms in deductive databases
Minker, J., & Nicolas, J.-M. (1983) · Information Systems · doi:10.1016/0306-4379(83)90024-8 · Cited by 71
Self-citationDEDUCE 2: Further Investigations of Deduction in Relational Data Bases
Chang, C. L. (1978) · Springer eBooks · doi:10.1007/978-1-4684-3384-5_8 · Cited by 70
Compiling Constraint-Checking Programs from First-Order Formulas
Henschen, L. J., McCune, W. W., & Naqvi, S. A. (1984) · Springer eBooks · doi:10.1007/978-1-4615-9385-0_6 · Cited by 64
Sadri, F., & Ullman, J. D. (1982) · Journal of the ACM · doi:10.1145/322307.322312 · Cited by 62
On Evaluation of Queries Containing Derived Relations in a Relational Data Base
Chang, C. L. (1981) · Springer eBooks · doi:10.1007/978-1-4615-8297-7_9 · Cited by 61
Two Results on Ordering for Resolution with Merging and Linear Format
Reiter, R. (1971) · Journal of the ACM · doi:10.1145/321662.321678 · Cited by 60
An Experimental Relational Data Base System Based on Logic
Minker, J. (1978) · Springer eBooks · doi:10.1007/978-1-4684-3384-5_5 · Cited by 54
Self-citationProving Consistency Of Database Transactions
Gardarin, G., & Melkanoff, M. A. (1979) · doi:10.1109/vldb.1979.718144 · Cited by 54
Search strategy and selection function for an inferential relational system
Minker, J. (1978) · ACM Transactions on Database Systems · doi:10.1145/320241.320242 · Cited by 49
Self-citationA Formal System for Reasoning about Programs Accessing a Relational Database
Casanova, M. R., & Bernstein, P. A. (1980) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357103.357111 · Cited by 46
An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
Sagiv, Y. (1980) · Journal of the ACM · doi:10.1145/322186.322190 · Cited by 46
An extension to linear resolution with selection function
Minker, J., & Zanon, G. (1982) · Information Processing Letters · doi:10.1016/0020-0190(82)90035-7 · Cited by 45
Self-citationThe interaction with incomplete knowledge bases: a formal treatment
Levesque, H. J. (1981) · Cited by 37
Applications of Protected Circumscription
Minker, J., & Perlis, D. R. (1984) · Lecture notes in computer science · doi:10.1007/978-0-387-34768-4_24 · Cited by 22
Self-citation
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
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.