On the public citation graph

Towards an efficient evaluation of recursive aggregates in deductive databases

https://doi.org/10.1007/bf03037339
0 signed · 53 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/3-540-16492-8_66openalex-snapshot
OLD resolution with tabulation
inferredcites →https://doi.org/10.1007/3-540-53507-1_87openalex-snapshot
Well!: An evaluation procedure for all logic programs
inferredcites →https://doi.org/10.1007/3-540-53507-1_90openalex-snapshot
Low complexity aggregation in graphlog and Datalog
inferredcites →https://doi.org/10.1007/3-540-57530-8_2openalex-snapshot
Foundations of aggregation in deductive databases
inferredcites →https://doi.org/10.1007/978-1-4615-3506-5_11openalex-snapshot
Efficient Bottom-Up Evaluation of Logic Programs
inferredcites →https://doi.org/10.1007/bf03037339openalex-snapshot
Towards an efficient evaluation of recursive aggregates in deductive databases
inferredcites →https://doi.org/10.1007/bf03037407openalex-snapshot
The Alexander Method — A technique for the processing of recursive axioms in deductive databases
inferredcites →https://doi.org/10.1016/0167-9236(86)90084-9openalex-snapshot
Recursive axioms in deductive databases: The query/subquery approach
inferredcites →https://doi.org/10.1016/0169-023x(90)90017-8openalex-snapshot
Query evaluation in recursive databases: bottom-up and top-down reconciled
inferredcites →https://doi.org/10.1016/0304-3975(51)90004-7openalex-snapshot
Negation by default and unstratifiable logic programs
inferredcites →https://doi.org/10.1016/0304-3975(89)90088-1openalex-snapshot
Recursive query processing: the power of logic
inferredcites →https://doi.org/10.1016/b978-0-444-88433-6.50010-1openalex-snapshot
Query Evaluation in Recursive Databases: Bottom-up and Top-down Reconciled
inferredcites →https://doi.org/10.1016/b978-0-444-88433-6.50015-0openalex-snapshot
On Deductive Query Evaluation in the DedGin* System
inferredcites →https://doi.org/10.1109/icde.1989.47239openalex-snapshot
Aggregative closure: an extension of transitive closure
inferredcites →https://doi.org/10.1145/103140.103141openalex-snapshot
A rule-based language with functions and sets
inferredcites →https://doi.org/10.1145/113413.113427openalex-snapshot
Minimum and maximum predicates in logic programming
inferredcites →https://doi.org/10.1145/137097.137115openalex-snapshot
The valid model semantics for logic programs
inferredcites →https://doi.org/10.1145/137097.137836openalex-snapshot
Greedy by choice
inferredcites →https://doi.org/10.1145/137097.137852openalex-snapshot
Monotonic aggregation in deductive databases
inferredcites →https://doi.org/10.1145/137097.137854openalex-snapshot
The well-founded semantics of aggregation
inferredcites →https://doi.org/10.1145/151333.151377openalex-snapshot
Shortest path by approximation in logic programs
inferredcites →https://doi.org/10.1145/16856.16871openalex-snapshot
Traversal recursion: a practical approach to supporting recursive applications
inferredcites →https://doi.org/10.1145/16894.16871openalex-snapshot
Traversal recursion: a practical approach to supporting recursive applications
inferredcites →https://doi.org/10.1145/170035.170067openalex-snapshot
Implementation of the CORAL deductive database system
inferredcites →https://doi.org/10.1145/28659.28689openalex-snapshot
On the power of magic
inferredcites →https://doi.org/10.1145/298514.298558openalex-snapshot
Modular stratification and magic sets for DATALOG programs with negation
inferredcites →https://doi.org/10.1145/322326.322332openalex-snapshot
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
inferredcites →https://doi.org/10.1145/38713.38725openalex-snapshot
Magic counting methods
inferredcites →https://doi.org/10.1145/38713.38743openalex-snapshot
The BANG file: A new kind of grid file
inferredcites →https://doi.org/10.1145/38714.38743openalex-snapshot
The BANG file: A new kind of grid file
inferredcites →https://doi.org/10.1145/66926.66948openalex-snapshot
Efficient evaluation of right-, left-, and multi-linear rules
inferredcites →https://doi.org/10.1145/73721.73723openalex-snapshot
Every logic program has a natural stratification and an iterated least fixed point model
inferredcites →https://doi.org/10.1145/73721.73725openalex-snapshot
Logic programming as constructivism: a formalization and its application to databases
inferredcites →https://doi.org/10.1145/73721.73736openalex-snapshot
Bottom-up beats top-down for datalog
inferredcites →https://doi.org/10.1145/73721.73737openalex-snapshot
On the power of Alexander templates

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jcss.1995.1064openalex-snapshot
Extrema Predicates in Deductive Databases
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_28openalex-snapshot
The deductive database system LOLA
inferred← citeshttps://doi.org/10.1007/978-1-4471-3225-7_17openalex-snapshot
Integrating Active and Deductive Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-60211-5_18openalex-snapshot
Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter
inferred← citeshttps://doi.org/10.1007/bf01228880openalex-snapshot
The CORAL deductive system
inferred← citeshttps://doi.org/10.1007/bf03037222openalex-snapshot
Aggregation and negation-as-failure
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1007/bfb0055498openalex-snapshot
Logical transactions and serializability
inferred← citeshttps://doi.org/10.1007/s002360050119openalex-snapshot
Average-case complexity for the execution of recursive definitions on relational databases
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00039-9openalex-snapshot
A survey of deductive database systems
inferred← citeshttps://doi.org/10.1016/s0306-4379(02)00006-6openalex-snapshot
Pushing extrema aggregates to optimize logic queries
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10007-3openalex-snapshot
Subsumption-stratified datalog
inferred← citeshttps://doi.org/10.1080/0899340930040201openalex-snapshot
An Educational Tool for Formal Relational Database Query Languages
inferred← citeshttps://doi.org/10.1109/69.729729openalex-snapshot
Efficient recursive aggregation and negation in deductive databases
inferred← citeshttps://doi.org/10.1145/151333.151377openalex-snapshot
Shortest path by approximation in logic programs
inferred← citeshttps://doi.org/10.14778/3311880.3311886openalex-snapshot
Scaling-up in-memory datalog processing
inferred← citeshttps://doi.org/10.1609/aimag.v18i3.1304openalex-snapshot
Logic and Databases Past, Present, and Future
showing the first 17 of 18 · page through all 18
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.