On the public citation graph
Generalized bottom-up query evaluation
0 signed · 39 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-51251-9_6openalex-snapshot
Specifying closed world assumptions for logic databases
inferredcites →https://doi.org/10.1007/3-540-53507-1_88openalex-snapshot
Beginnings of a theory of general database completions
inferredcites →https://doi.org/10.1007/3-540-55015-1_22openalex-snapshot
Semantics of inheritance In logical object specifications
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-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf00248321openalex-snapshot
Weak Generalized Closed World Assumption
inferredcites →https://doi.org/10.1007/bf00297247openalex-snapshot
Inferring negative information from disjunctive databases
inferredcites →https://doi.org/10.1007/bfb0000066openalex-snapshot
On indefinite databases and the closed world assumption
inferredcites →https://doi.org/10.1016/0004-3702(80)90011-9openalex-snapshot
Circumscription—A form of non-monotonic reasoning
inferredcites →https://doi.org/10.1016/0004-3702(85)90040-2openalex-snapshot
Saturation, nonmonotonic reasoning and the closed-world assumption
inferredcites →https://doi.org/10.1016/0004-3702(86)90032-9openalex-snapshot
Applications of circumscription to formalizing common-sense knowledge
inferredcites →https://doi.org/10.1016/0004-3702(89)90026-xopenalex-snapshot
A circumscriptive theorem prover
inferredcites →https://doi.org/10.1016/0004-3702(89)90067-2openalex-snapshot
An algorithm to compute circumscription
inferredcites →https://doi.org/10.1016/0169-023x(90)90017-8openalex-snapshot
Query evaluation in recursive databases: bottom-up and top-down reconciled
inferredcites →https://doi.org/10.1016/0306-4379(86)90003-7openalex-snapshot
The relational model with relation-valued attributes
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/c2013-0-07699-2openalex-snapshot
Foundations of Deductive Databases and Logic Programming
inferredcites →https://doi.org/10.1016/s0743-1066(85)80002-9openalex-snapshot
Computing protected circumscription
inferredcites →https://doi.org/10.1109/lics.1991.151660openalex-snapshot
Defaults and revision in structured theories
inferredcites →https://doi.org/10.1145/16856.16859openalex-snapshot
An amateur's introduction to recursive query processing strategies
inferredcites →https://doi.org/10.1145/16894.16859openalex-snapshot
An amateur's introduction to recursive query processing strategies
inferredcites →https://doi.org/10.1145/6012.15409openalex-snapshot
Positivism vs minimalism in deductive databases
inferredcites →https://doi.org/10.5860/choice.26-5107openalex-snapshot
Principles of database and knowledge-base systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-55015-1_22openalex-snapshot
Semantics of inheritance In logical object specifications
inferred← citeshttps://doi.org/10.1007/3-540-57530-8_16openalex-snapshot
Bottom-up query evaluation with partially ordered defaults
inferred← citeshttps://doi.org/10.1007/978-1-4471-3016-1_25openalex-snapshot
Safe Derivations in Object Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_47openalex-snapshot
Negative Hyper-resolution as Procedural Semantics of Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-51136-3_12openalex-snapshot
Improved Bottom-Up Query Evaluation in Positive Disjunctive Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-51136-3_13openalex-snapshot
A Disjunctive Semantics Based on Unfolding and Bottom-Up Evaluation
inferred← citeshttps://doi.org/10.1007/bfb0030392openalex-snapshot
Deduction with supernormal defaults
inferred← citeshttps://doi.org/10.1007/bfb0030663openalex-snapshot
A general approach to bottom-up computation of disjunctive semantics
inferred← citeshttps://doi.org/10.1016/s0169-023x(00)00016-1openalex-snapshot
Minimal model generation for refined answering of generalized queries in disjunctive deductive databases
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10030-4openalex-snapshot
Semantics of (disjunctive) logic programs based on partial evaluation
inferred← citeshttps://doi.org/10.5445/ir/1000003797openalex-snapshot
Reasoning in description logics using resolution and deductive databases
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.