On the public citation graph

On Bounded Database Schemes and Bounded Horn-Clause Programs

0 signed · 43 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-5openalex-snapshot
Logic and Data Bases
inferredcites →https://doi.org/10.1016/0022-0000(82)90008-3openalex-snapshot
Algebraic dependencies
inferredcites →https://doi.org/10.1016/0022-0000(84)90079-5openalex-snapshot
Independent database schemas
inferredcites →https://doi.org/10.1016/0167-6423(84)90013-3openalex-snapshot
The theory of relational databases
inferredcites →https://doi.org/10.1137/0208017openalex-snapshot
Equivalences among Relational Expressions
inferredcites →https://doi.org/10.1137/0210025openalex-snapshot
Equivalence of Relational Database Schemes
inferredcites →https://doi.org/10.1137/0212003openalex-snapshot
Tools for Template Dependencies
inferredcites →https://doi.org/10.1137/0212020openalex-snapshot
Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions
inferredcites →https://doi.org/10.1137/0213006openalex-snapshot
Formal Systems for Tuple and Equality Generating Dependencies
inferredcites →https://doi.org/10.1137/0214026openalex-snapshot
Some Results on the Representative Instance in Relational Databases
inferredcites →https://doi.org/10.1145/102782.102787openalex-snapshot
Evaluation of queries in independent database schemes
inferredcites →https://doi.org/10.1145/1634.1636openalex-snapshot
A Proof Procedure for Data Dependencies
inferredcites →https://doi.org/10.1145/319983.319988openalex-snapshot
A characterization of globally consistent databases and their correct access paths
inferredcites →https://doi.org/10.1145/320064.320066openalex-snapshot
Computational problems related to the design of normal form relational schemas
inferredcites →https://doi.org/10.1145/320083.320091openalex-snapshot
The theory of joins in relational databases
inferredcites →https://doi.org/10.1145/320107.320112openalex-snapshot
Efficient optimization of a class of relational expressions
inferredcites →https://doi.org/10.1145/320107.320115openalex-snapshot
Testing implications of data dependencies
inferredcites →https://doi.org/10.1145/322217.322221openalex-snapshot
Equivalences Among Relational Expressions with the Union and Difference Operators
inferredcites →https://doi.org/10.1145/322326.322330openalex-snapshot
Testing satisfaction of functional dependencies
inferredcites →https://doi.org/10.1145/322344.322347openalex-snapshot
Horn clauses and database dependencies
inferredcites →https://doi.org/10.1145/329.318579openalex-snapshot
Database states and their tableaux
inferredcites →https://doi.org/10.1145/329.318580openalex-snapshot
On the foundations of the universal relation model
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/582318.582336openalex-snapshot
Can we use the universal instance assumption without using nulls?

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-50171-1_8openalex-snapshot
Idempotent single-predicate horn clauses
inferred← citeshttps://doi.org/10.1007/3-540-55493-9_7openalex-snapshot
Concluding remarks and ongoing research
inferred← citeshttps://doi.org/10.1007/bf02238727openalex-snapshot
Systolic algorithms for computational geometry problems — A survey
inferred← citeshttps://doi.org/10.1007/s11741-007-0105-2openalex-snapshot
A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately
inferred← citeshttps://doi.org/10.1016/0169-023x(89)90028-1openalex-snapshot
A survey of the universal relation model
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90308-3openalex-snapshot
On characterizing boundedness of database schemes with bounded dependencies
inferred← citeshttps://doi.org/10.1016/0743-1066(91)90037-popenalex-snapshot
A simple characterization of uniform boundedness for a class of recursions
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00051-kopenalex-snapshot
Undecidable boundedness problems for datalog programs
inferred← citeshttps://doi.org/10.1016/b978-0-12-708240-0.50011-3openalex-snapshot
Automata Theory for Database Theoreticians*†*Theoretician: 1. One who theorizes. 2. One who bases practice on theory. (From Webster's 3rd Int'l Dictionary, 1961.)†An earlier and shorter version of this paper appeared in Proc. 8th ACM Symp. on Principles of Database Systems, 1989, pp. 83–92
inferred← citeshttps://doi.org/10.1109/icc.2007.576openalex-snapshot
Load-Balanced Clustering Algorithms for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/icccn.2006.286262openalex-snapshot
An Approximation Algorithm for The Load-Balanced Clustering Problem in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1137/0222003openalex-snapshot
On the Boundedness of Constant-Time-Maintainable Database Schemes
inferred← citeshttps://doi.org/10.1145/113413.113414openalex-snapshot
Tools for Datalog boundedness
inferred← citeshttps://doi.org/10.1145/113413.113423openalex-snapshot
Structural query optimization—a uniform framework for semantic query optimization in deductive databases
inferred← citeshttps://doi.org/10.1145/115234.115362openalex-snapshot
Independence-reducible database schemes
inferred← citeshttps://doi.org/10.1145/115302.115301openalex-snapshot
Constant-time-maintainable BCNF database schemes
inferred← citeshttps://doi.org/10.1145/155271.155275openalex-snapshot
Semantics for null extended nested relations
inferred← citeshttps://doi.org/10.1145/308386.308431openalex-snapshot
Independence-reducible database schemes
inferred← citeshttps://doi.org/10.26180/14973144openalex-snapshot
The semantic justification for normal forms in relational database design
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.