On the public citation graph
Domain independence and the relational calculus
0 signed · 60 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/0022-0000(80)90032-xopenalex-snapshot
Computable queries for relational data bases
inferredcites →https://doi.org/10.1016/0022-0000(91)90036-5openalex-snapshot
On the expressive power of database queries with intermediate types
inferredcites →https://doi.org/10.1016/0167-6423(84)90013-3openalex-snapshot
The theory of relational databases
inferredcites →https://doi.org/10.1016/0304-3975(93)90219-jopenalex-snapshot
On the complexity of queries in the logical data model
inferredcites →https://doi.org/10.1016/b978-1-4832-1313-2.50037-8openalex-snapshot
ON SAFETY, DOMAIN INDEPENDENCE, AND CAPTURABILITY OF DATABASE QUERIES* (Preliminary Report)*Research sponsored in part by the NSF grant DCR-8603676.
inferredcites →https://doi.org/10.1137/0215061openalex-snapshot
Relative Information Capacity of Simple Relational Database Schemata
inferredcites →https://doi.org/10.1145/28659.28688openalex-snapshot
A translation language complete for database update and specification
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/73721.73755openalex-snapshot
Untyped sets, invention, and computable queries
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1998.2734openalex-snapshot
The Expressive Power of Stratified Logic Programs with Value Invention
inferred← citeshttps://doi.org/10.1006/jcss.1997.1523openalex-snapshot
Query Languages for Bags and Aggregate Functions
inferred← citeshttps://doi.org/10.1006/jcss.1997.1524openalex-snapshot
Finitely Representable Databases
inferred← citeshttps://doi.org/10.1006/jcss.1999.1633openalex-snapshot
Reasoning about Strings in Databases
inferred← citeshttps://doi.org/10.1007/3-540-44543-9_5openalex-snapshot
How to Make SQL Stand for String Query Language
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_92openalex-snapshot
Constraint programming and database query languages
inferred← citeshttps://doi.org/10.1007/3-540-68804-8openalex-snapshot
Finite Model Theory and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-68804-8_5openalex-snapshot
Embedded Finite Models and Constraint Databases
inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_1255openalex-snapshot
Safety and Domain Independence
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_1255openalex-snapshot
Safety and Domain Independence
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_1255-2openalex-snapshot
Safety and Domain Independence
inferred← citeshttps://doi.org/10.1007/978-3-031-15707-3_7openalex-snapshot
SHACL: A Description Logic in Disguise
inferred← citeshttps://doi.org/10.1007/978-3-031-19135-0_3openalex-snapshot
The Past and Future of Embedded Finite Model Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-57246-3_16openalex-snapshot
Explainable Online Monitoring of Metric First-Order Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-04474-8_10openalex-snapshot
Combining Consistency and Confidentiality Requirements in First-Order Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-16961-8_72openalex-snapshot
Mapping ORM to Datalog: An Overview
inferred← citeshttps://doi.org/10.1007/978-3-662-04031-7_3openalex-snapshot
Expressive Power: The Finite Case
inferred← citeshttps://doi.org/10.1007/s11390-019-1943-7openalex-snapshot
On the Expressive Power of Logics on Constraint Databases with Complex Objects
inferred← citeshttps://doi.org/10.1007/springerreference_64170openalex-snapshot
Safety and Domain Independence
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90036-5openalex-snapshot
On the expressive power of database queries with intermediate types
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90022-oopenalex-snapshot
Algebraic and calculus query languages for recursively typed complex objects
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90222-fopenalex-snapshot
A closed-form evaluation for Datalog queries with integer (gap)-order constraints
inferred← citeshttps://doi.org/10.1016/j.ins.2008.02.005openalex-snapshot
Safety, domain independence and translation of complex value database queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.04.026openalex-snapshot
A sound and complete model-generation procedure for consistent and confidentiality-preserving databases
inferred← citeshttps://doi.org/10.1016/s0169-023x(01)00022-2openalex-snapshot
Safety, domain independence and generalized quantification
inferred← citeshttps://doi.org/10.1017/jsl.2026.10195openalex-snapshot
THE EXPRESSIVENESS AND COMPLEXITY LANDSCAPE FOR EVALUATING FORMULAS OVER EMBEDDED FINITE MODELS
inferred← citeshttps://doi.org/10.1090/s0002-9947-00-02672-6openalex-snapshot
Stability theory, permutations of indiscernibles, and embedded finite models
inferred← citeshttps://doi.org/10.1109/lics.1995.523246openalex-snapshot
First-order queries on finite structures over the reals
inferred← citeshttps://doi.org/10.1109/lics.1996.561300openalex-snapshot
On the structure of queries in constraint query languages
inferred← citeshttps://doi.org/10.1109/lics.1998.705682openalex-snapshot
Embedded finite models, stability theory, and the impact of order
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175804openalex-snapshot
Embedded Finite Models beyond Restricted Quantifier Collapse
inferred← citeshttps://doi.org/10.1137/s009753979629766openalex-snapshot
First-Order Queries on Finite Structures Over the Reals
inferred← citeshttps://doi.org/10.1145/170035.170089openalex-snapshot
Interpreting a reconstructed relational calculus (extended abstract)
inferred← citeshttps://doi.org/10.1145/170036.170089openalex-snapshot
Interpreting a reconstructed relational calculus (extended abstract)
inferred← citeshttps://doi.org/10.1145/190616.190619openalex-snapshot
Database querying and constraint programming
inferred← citeshttps://doi.org/10.1145/212433.212447openalex-snapshot
Constraint programming and database languages
inferred← citeshttps://doi.org/10.1145/237661.237667openalex-snapshot
Relational expressive power of constraint query languages
inferred← citeshttps://doi.org/10.1145/263661.263672openalex-snapshot
Languages for relational databases over interpreted structures
inferred← citeshttps://doi.org/10.1145/273865.273870openalex-snapshot
Relational expressive power of constraint query languages
inferred← citeshttps://doi.org/10.1145/335168.335218openalex-snapshot
Expressive power and data complexity of nonrecursive query languages for lists and trees (extended abstract)
inferred← citeshttps://doi.org/10.1145/337885.337894openalex-snapshot
Query languages with arithmetic and constraint databases
inferred← citeshttps://doi.org/10.1145/347476.347477openalex-snapshot
Relational queries over interpreted structures
inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:38)2023openalex-snapshot
Efficient Evaluation of Arbitrary Relational Calculus Queries
inferred← citeshttps://doi.org/10.46298/lmcs-20(1:16)2024openalex-snapshot
Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests
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.