On the public citation graph

Incomplete deductive databases

https://doi.org/10.1007/bf01530927
0 signed · 48 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_3openalex-snapshot
On Closed World Data Bases
inferredcites →https://doi.org/10.1007/978-3-322-90102-6openalex-snapshot
Automated Theorem Proving
inferredcites →https://doi.org/10.1007/bfb0000066openalex-snapshot
On indefinite databases and the closed world assumption
inferredcites →https://doi.org/10.1016/0016-0032(60)90676-1openalex-snapshot
An introduction to the theory of numbers
inferredcites →https://doi.org/10.1016/0022-0000(84)90075-8openalex-snapshot
Inclusion dependencies and their interaction with functional dependencies
inferredcites →https://doi.org/10.1016/0022-0000(86)90016-4openalex-snapshot
Querying logical databases
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1145/1005937.1005947openalex-snapshot
Logic for problem solving
inferredcites →https://doi.org/10.1145/1634.1636openalex-snapshot
A Proof Procedure for Data Dependencies
inferredcites →https://doi.org/10.1145/1634.1886openalex-snapshot
Incomplete Information in Relational Databases
inferredcites →https://doi.org/10.1145/16856.16859openalex-snapshot
An amateur's introduction to recursive query processing strategies
inferredcites →https://doi.org/10.1145/16856.16881openalex-snapshot
Query processing in deductive databases with incomplete information
inferredcites →https://doi.org/10.1145/16894.16859openalex-snapshot
An amateur's introduction to recursive query processing strategies
inferredcites →https://doi.org/10.1145/16894.16881openalex-snapshot
Query processing in deductive databases with incomplete information
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.1145/356924.356929openalex-snapshot
Logic and Databases: A Deductive Approach
inferredcites →https://doi.org/10.1145/357980.358007openalex-snapshot
A relational model of data for large shared data banks
inferredcites →https://doi.org/10.1145/362384.362685openalex-snapshot
A relational model of data for large shared data banks
inferredcites →https://doi.org/10.1145/38713.38724openalex-snapshot
On the representation and querying of sets of possible worlds
inferredcites →https://doi.org/10.1145/5383.5388openalex-snapshot
A sound and sometimes complete query evaluation algorithm for relational databases with null values
inferredcites →https://doi.org/10.1145/588111.588148openalex-snapshot
The inference problem for template dependencies
inferredcites →https://doi.org/10.1145/588111.588149openalex-snapshot
The implication and finite implication problems for typed template dependencies
inferredcites →https://doi.org/10.1145/73721.73726openalex-snapshot
Complexity of query processing in databases with OR-objects
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/1-4020-3092-4_1openalex-snapshot
Knowledge Representation with Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_18openalex-snapshot
Disjunctive Logic Programming: A Survey and Assessment
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_31openalex-snapshot
Semantics of disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_45openalex-snapshot
Minimizing indefinite information in disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5_10openalex-snapshot
Logical Approaches to Incomplete Information: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-60211-5_18openalex-snapshot
Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter
inferred← citeshttps://doi.org/10.1007/bf01263049openalex-snapshot
Searching a minimal semantically-equivalent subset of a set of partial values
inferred← citeshttps://doi.org/10.1007/bf01530759openalex-snapshot
Overview of disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bf01530818openalex-snapshot
Dynamic maintenance of the transitive closure in disjunctive graphs
inferred← citeshttps://doi.org/10.1007/bfb0013073openalex-snapshot
Disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1007/bfb0052186openalex-snapshot
Declarative object-oriented programming: Inheritance, subtyping and prototyping
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90223-gopenalex-snapshot
Recursively indefinite databases
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50013-7openalex-snapshot
Logic and Databases: A History of Deductive Databases
inferred← citeshttps://doi.org/10.1016/j.artint.2016.04.005openalex-snapshot
Querying incomplete information in RDF with SPARQL
inferred← citeshttps://doi.org/10.1016/j.is.2019.03.010openalex-snapshot
Approximation algorithms for querying incomplete databases
inferred← citeshttps://doi.org/10.1016/s0004-3702(96)00009-4openalex-snapshot
Is intractability of nonmonotonic reasoning a real drawback?
inferred← citeshttps://doi.org/10.1109/69.476493openalex-snapshot
Using constraints for efficient query processing in nondeterministic databases
inferred← citeshttps://doi.org/10.1109/69.494166openalex-snapshot
Evaluating aggregate operations over imprecise data
inferred← citeshttps://doi.org/10.1109/69.506705openalex-snapshot
Current approaches to handling imperfect information in data and knowledge bases
inferred← citeshttps://doi.org/10.1145/3216122.3220542openalex-snapshot
Algorithms for Computing Approximate Certain Answers over Incomplete Databases
inferred← citeshttps://doi.org/10.1145/66926.66932openalex-snapshot
CLASSIC: a structural data model for objects
inferred← citeshttps://doi.org/10.1145/67544.66932openalex-snapshot
CLASSIC: a structural data model for objects
inferred← citeshttps://doi.org/10.4230/dfu.vol5.10452.161openalex-snapshot
Semantics for Non-Monotone Queries in Data Exchange and Data Integration
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.