On the public citation graph
Reasoning with examples: propositional formulae and database dependencies
0 signed · 42 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.1006/jagm.1996.0062openalex-snapshot
On the Complexity of Dualization of Monotone Disjunctive Normal Forms
inferredcites →https://doi.org/10.1016/0004-3702(94)00072-9openalex-snapshot
Horn approximations of empirical data
inferredcites →https://doi.org/10.1016/0020-0190(88)90070-1openalex-snapshot
Positive Boolean dependencies
inferredcites →https://doi.org/10.1016/0022-0000(78)90009-0openalex-snapshot
Candidate keys for relations
inferredcites →https://doi.org/10.1016/0022-0000(86)90015-2openalex-snapshot
Design by example: An application of Armstrong relations
inferredcites →https://doi.org/10.1016/0304-3975(95)00028-uopenalex-snapshot
Approximate inference of functional dependencies from relations
inferredcites →https://doi.org/10.1109/18.119713openalex-snapshot
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
inferredcites →https://doi.org/10.1109/isit.1991.695195openalex-snapshot
Construction Of Asymptotically Good Low-rate Error-correcting Codes Through Pseudo-random Graphs
inferredcites →https://doi.org/10.1109/sfcs.1986.48openalex-snapshot
Proving by example and gap theorems
inferredcites →https://doi.org/10.1109/sfcs.1993.366857openalex-snapshot
Exact learning via the Monotone theory
inferredcites →https://doi.org/10.1137/s0097539793250299openalex-snapshot
Identifying the Minimal Transversals of a Hypergraph and Related Problems
inferredcites →https://doi.org/10.1145/226643.226644openalex-snapshot
Knowledge compilation and theory approximation
inferredcites →https://doi.org/10.1145/2422.322414openalex-snapshot
On the Structure of Armstrong Relations for Functional Dependencies
inferredcites →https://doi.org/10.1145/322261.322263openalex-snapshot
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
inferredcites →https://doi.org/10.1145/322344.322347openalex-snapshot
Horn clauses and database dependencies
inferredcites →https://doi.org/10.1145/325405.325431openalex-snapshot
An improved algorithm for finding a key of a relation
inferredcites →https://doi.org/10.1613/jair.183openalex-snapshot
Translating between Horn Representations and their Characteristic Models
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-48344-6_11openalex-snapshot
Temporal Dependencies Generalized for Spatial and Other Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-319-24486-0_5openalex-snapshot
Exact Learning of Multivalued Dependencies
inferred← citeshttps://doi.org/10.1007/978-3-540-39624-6_1openalex-snapshot
Abduction and the Dualization Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-39644-4_1openalex-snapshot
Abduction and the Dualization Problem
inferred← citeshttps://doi.org/10.1007/s00224-015-9659-8openalex-snapshot
Learning Sets of Antecedent-restricted Functional and Multivalued Dependencies with Queries
inferred← citeshttps://doi.org/10.1007/s00354-015-0301-8openalex-snapshot
Learning an Extension of the Class of Functional Dependencies with Queries
inferred← citeshttps://doi.org/10.1016/j.artint.2015.08.005openalex-snapshot
The Complexity of Reasoning with FODD and GFODD
inferred← citeshttps://doi.org/10.1016/j.datak.2009.06.001openalex-snapshot
Constraint acquisition for Entity-Relationship models
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.07.007openalex-snapshot
Negative results on learning multivalued dependencies with queries
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.12.012openalex-snapshot
Characterisations of multivalued dependency implication over undetermined universes
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.01.011openalex-snapshot
On learning multivalued dependencies with queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.018openalex-snapshot
Exact learning of multivalued dependency formulas
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00118-7openalex-snapshot
On functional dependencies in q-Horn theories
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00114-3openalex-snapshot
Functional dependencies in Horn theories
inferred← citeshttps://doi.org/10.1023/a:1007627028578openalex-snapshot
Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries
inferred← citeshttps://doi.org/10.1145/1284320.1284323openalex-snapshot
On computing all abductive explanations from a propositional Horn theory
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/267460.267500openalex-snapshot
Generating all maximal independent sets of bounded-degree hypergraphs
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8862openalex-snapshot
The Complexity of Reasoning with FODD and GFODD
inferred← citeshttps://doi.org/10.1613/jair.183openalex-snapshot
Translating between Horn Representations and their Characteristic Models
inferred← citeshttps://doi.org/10.22029/jlupub-7000openalex-snapshot
Computing intersections of Horn theories for reasoning with models
inferred← citeshttps://doi.org/10.5555/777092.777105openalex-snapshot
On computing all abductive explanations
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.