On the public citation graph
On the expressive power of data dependencies
0 signed · 50 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-10843-2_8openalex-snapshot
Characterizing data base Dependencies
inferredcites →https://doi.org/10.1007/3-540-15198-2_24openalex-snapshot
Why Horn formulas matter in computer science: Initial structures and generic examples
inferredcites →https://doi.org/10.1007/bfb0099486openalex-snapshot
Toward logic tailored for computational complexity
inferredcites →https://doi.org/10.1016/0304-3975(83)90019-1openalex-snapshot
Characterizations for functional dependency and Boyce-Codd normal form families
inferredcites →https://doi.org/10.1016/0743-1066(85)90002-0openalex-snapshot
Horn clause queries and generalizations
inferredcites →https://doi.org/10.1016/s0049-237x(08)71821-4openalex-snapshot
Model Theoretic Issues in Theoretical Computer Science, Part I: Relational Data Bases and Abstract Data Types
inferredcites →https://doi.org/10.1016/s0049-237x(08)71960-8openalex-snapshot
Securable Quantifiers, κ-Unions and Admissible Sets
inferredcites →https://doi.org/10.1017/s0305004100013463openalex-snapshot
On the Structure of Abstract Algebras
inferredcites →https://doi.org/10.1137/0208017openalex-snapshot
Equivalences among Relational Expressions
inferredcites →https://doi.org/10.1145/1634.1636openalex-snapshot
A Proof Procedure for Data Dependencies
inferredcites →https://doi.org/10.1145/319702.319730openalex-snapshot
On interpretations of relational languages and solutions to the implied constraint problem
inferredcites →https://doi.org/10.1145/320557.320571openalex-snapshot
Multivalued dependencies and a new normal form for relational databases
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/322326.322330openalex-snapshot
Testing satisfaction of functional dependencies
inferredcites →https://doi.org/10.1145/322326.322331openalex-snapshot
Properties of functional-dependency families
inferredcites →https://doi.org/10.1145/322344.322347openalex-snapshot
Horn clauses and database dependencies
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/588011.588052openalex-snapshot
On the complexity and axiomatizability of consistent database states
inferredcites →https://doi.org/10.1145/588111.588137openalex-snapshot
Horn clauses and the fixpoint query hierarchy
inferredcites →https://doi.org/10.1145/6012.15419openalex-snapshot
On the integrity of databases with incomplete information
inferredcites →https://doi.org/10.1145/62.2162openalex-snapshot
Finitely Specifiable Implicational Dependency Families
inferredcites →https://doi.org/10.1145/800076.802488openalex-snapshot
Embedded implicational dependencies and their inference problem
inferredcites →https://doi.org/10.1145/800105.803397openalex-snapshot
Optimal implementation of conjunctive queries in relational data bases
inferredcites →https://doi.org/10.2307/2268172openalex-snapshot
The decision problem for some classes of sentences without quantifiers
inferredcites →https://doi.org/10.2307/2273786openalex-snapshot
Vopěnka's principle and compact logics
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-15198-2_24openalex-snapshot
Why Horn formulas matter in computer science: Initial structures and generic examples
inferred← citeshttps://doi.org/10.1007/978-3-031-86319-6_24openalex-snapshot
Characterizing Data Dependencies Then and Now
inferred← citeshttps://doi.org/10.1007/978-3-319-06025-5_3openalex-snapshot
Schema Mappings: A Case of Logical Dynamics in Database Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_14openalex-snapshot
Logics of Finite Hankel Rank
inferred← citeshttps://doi.org/10.1007/978-3-663-12018-6openalex-snapshot
Dependencies in Relational Databases
inferred← citeshttps://doi.org/10.1007/bfb0019911openalex-snapshot
Translation schemes and the fundamental problem of database design
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90116-xopenalex-snapshot
Some characterizations of finitely specifiable implicational dependency families
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90027-4openalex-snapshot
Why horn formulas matter in computer science: Initial structures and generic examples
inferred← citeshttps://doi.org/10.1016/0306-4379(93)90010-xopenalex-snapshot
Refinement of enquiries in retrieval systems based on the universal relation model
inferred← citeshttps://doi.org/10.1016/0898-1221(91)90226-topenalex-snapshot
On a general class of data dependencies in the relational model and its implication problems
inferred← citeshttps://doi.org/10.1016/j.ins.2013.01.009openalex-snapshot
Reasoning about functional and full hierarchical dependencies over partial relations
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80021-2openalex-snapshot
Unique complements and decompositions of database schemata
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80047-9openalex-snapshot
The impact of model theory on theoretical computer science
inferred← citeshttps://doi.org/10.1016/s0169-023x(97)00029-3openalex-snapshot
Dependency preserving refinements and the fundamental problem of database design
inferred← citeshttps://doi.org/10.1145/1514894.1514903openalex-snapshot
Structural characterizations of schema-mapping languages
inferred← citeshttps://doi.org/10.1145/1629175.1629201openalex-snapshot
Structural characterizations of schema-mapping languages
inferred← citeshttps://doi.org/10.1145/2188349.2188355openalex-snapshot
The implication problem of data dependencies over SQL table definitions
inferred← citeshttps://doi.org/10.1145/3452021.3458310openalex-snapshot
Model-theoretic Characterizations of Rule-based Ontologies
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20540openalex-snapshot
Characterizing the Program Expressive Power of Existential Rule Languages
inferred← citeshttps://doi.org/10.21236/ada212160openalex-snapshot
On Implicational Dependency Families Possessing Finite Armstrong Relations
inferred← citeshttps://doi.org/10.24963/ijcai.2020/269openalex-snapshot
Model-theoretic Characterizations of Existential Rule Languages
inferred← citeshttps://doi.org/10.4230/lipics.csl.2011.553openalex-snapshot
Model Theory in Computer Science: My Own Recurrent Themes
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.