On the public citation graph
The poset of closures as a model of changing databases
0 signed · 38 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.1016/b978-0-12-161901-5.50023-6openalex-snapshot
INFORMATION PROCESSING
inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb22446.xopenalex-snapshot
On the Number of Unions in a Family of Setsa
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.1215/s0012-7094-52-01972-8openalex-snapshot
Distributivity in lattices
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-19121-6_7openalex-snapshot
Extremal combinatorial problems of database models
inferred← citeshttps://doi.org/10.1007/3-540-51251-9_10openalex-snapshot
Functional dependencies and the semilattice of closed classes
inferred← citeshttps://doi.org/10.1007/3-540-54009-1_17openalex-snapshot
On the representation of dependencies by propositional logic
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_30openalex-snapshot
Combinatorial and algebraic results for database relations
inferred← citeshttps://doi.org/10.1007/978-3-642-11829-6_8openalex-snapshot
On the Distance of Databases
inferred← citeshttps://doi.org/10.1007/978-3-663-12018-6openalex-snapshot
Dependencies in Relational Databases
inferred← citeshttps://doi.org/10.1007/978-3-7908-1865-9_8openalex-snapshot
A Combinatorial Characterization of Fuzzy Functional Dependencies
inferred← citeshttps://doi.org/10.1007/bf01068647openalex-snapshot
Database models and closure operators
inferred← citeshttps://doi.org/10.1007/bf01556350openalex-snapshot
A survey of some combinatorial results concerning functional dependencies in database relations
inferred← citeshttps://doi.org/10.1007/s10472-012-9306-xopenalex-snapshot
On the distance of databases
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90024-4openalex-snapshot
Some problems concerning keys for relation schemes and relations in the relational datamodel
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90028-9openalex-snapshot
Functional dependencies in relational databases: A lattice point of view
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00076-4openalex-snapshot
Some results about normal forms for functional dependency in the relational datamodel
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90359-aopenalex-snapshot
On the number of databases and closure operations
inferred← citeshttps://doi.org/10.1016/0898-1221(93)90033-ropenalex-snapshot
Algorithms for Generating an Armstrong Relation and Inferring Functional Dependencies in the Relational Datamodel
inferred← citeshttps://doi.org/10.1016/0898-1221(94)00243-eopenalex-snapshot
Family of functional dependencies and its equivalent descriptions
inferred← citeshttps://doi.org/10.1016/j.dam.2005.04.009openalex-snapshot
Generalized domination in closure systems
inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.038openalex-snapshot
Functional dependencies distorted by errors
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2003.09.008openalex-snapshot
Closure systems, implicational systems, overhanging relations and the case of hierarchical classification
inferred← citeshttps://doi.org/10.1016/s0165-4896(03)00072-6openalex-snapshot
The presence of lattice theory in discrete problems of mathematical social sciences. Why
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00209-3openalex-snapshot
The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00012-5openalex-snapshot
Surmise relations between tests
inferred← citeshttps://doi.org/10.1023/a:1006444906980openalex-snapshot
A Characterization Theorem for the Canonical Basis of a Closure Operator
inferred← citeshttps://doi.org/10.1023/a:1013133428451openalex-snapshot
On the implication problem for cardinality constraints and functional dependencies
inferred← citeshttps://doi.org/10.1109/ines.1997.632423openalex-snapshot
The combinatorial structure of fuzzy functional dependencies
inferred← citeshttps://doi.org/10.1137/s0097539793250299openalex-snapshot
Identifying the Minimal Transversals of a Hypergraph and Related Problems
inferred← citeshttps://doi.org/10.15625/1813-9663/13/2/7991openalex-snapshot
An ninh dữ liệu và an ninh các mạng LAN
inferred← citeshttps://doi.org/10.15625/1813-9663/13/3/8001openalex-snapshot
Armstrong relations and strong dependencies
inferred← citeshttps://doi.org/10.15625/1813-9663/14/2/7892openalex-snapshot
On the computational algorithm related to antikeys
inferred← citeshttps://doi.org/10.15625/1813-9663/14/4/7974openalex-snapshot
On the connections between relations, relation schemes and keys
inferred← citeshttps://doi.org/10.15625/1813-9663/16/2/2865openalex-snapshot
Some observations on the second normal form
inferred← citeshttps://doi.org/10.46298/dmtcs.309openalex-snapshot
Some lattices of closure systems on a finite set
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.