The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
On Databases with Incomplete Information
Open accessAbstract
Semantic and logical problems arising in an incomplete information database are investigated.A simple query language is described, and its semantics, which refers the queries to the information about reality contained in a database, rather than to reality itself, is defined.This approach, called the internal interpretation, is shown to lead in a natural way to the notions of a topological Boolean algebra and a modal logic related to $4 in the same way as referring queries directly to reality (external interpretation) leads to Boolean algebras and classical logic.An axiom system is given for equivalent (with respect to the internal interpretation) transformation of queries, which is then exploited as a basic tool in a method for computing the internal interpretation for a broad class of queries.An interesting special case of the problem of determining the internal interpretation amounts to deciding whether an assertion about reality (a "yes-no" query) is consistent with the incomplete information about reality contained in a database.A solution to this problem, which relies on the classical combinatorial problem of distinct representatives of subsets, is given.
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
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 relational model of data for large shared data banks
Codd, E. F. (1983) · Communications of the ACM · doi:10.1145/357980.358007 · Cited by 4,796
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,802
Hall, P. (1935) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-10.37.26 · Cited by 1,954
Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
Kripke, S. A. (1963) · Mathematical Logic Quarterly · doi:10.1002/malq.19630090502 · Cited by 1,287
On semantic issues connected with incomplete information databases
Lipski, W. (1979) · ACM Transactions on Database Systems · doi:10.1145/320083.320088 · Cited by 512
Self-citationAn Introduction to Modal Logic.
Duthie, G. D., HUGHES, G. E., & Cresswell, M. J. (1971) · The Philosophical Quarterly · doi:10.2307/2217584 · Cited by 197
Cited by
Incomplete Information in Relational Databases
Imieliński, T., & Lipski, W. (1984) · Journal of the ACM · doi:10.1145/1634.1886 · Cited by 1,013
Self-citationFuzzy functional dependencies and lossless join decomposition of fuzzy relational database systems
Raju, K. V. S. V. N., & Majumdar, A. K. (1988) · ACM Transactions on Database Systems · doi:10.1145/42338.42344 · Cited by 406
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
Metadata
- Authors
- Lipski, W.
- Venue
- Journal of the ACM
- Published
- 1981-01
- Volume
- 28
- Issue
- 1
- Pages
- 41-70
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1994581962
- Cited by
- 275
- References
- 7
- FWCI
- 6.94
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On Databases with Incomplete Information. https://app.cochat.ai/papers/10.1145/322234.322239
- The paper
- Lipski, W. (1981). On Databases with Incomplete Information. Journal of the ACM. https://doi.org/10.1145/322234.322239
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.