On the public citation graph

How expressive is stratified aggregation?

https://doi.org/10.1007/bf01536403
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.1006/jcss.1995.1053openalex-snapshot
The Expressive Powers of the Logic Programming Semantics
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-55015-1_7openalex-snapshot
Non-determinism in deductive databases
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf01932293openalex-snapshot
Horn clause computability
inferredcites →https://doi.org/10.1016/0022-0000(80)90032-xopenalex-snapshot
Computable queries for relational data bases
inferredcites →https://doi.org/10.1016/0304-3975(93)90221-eopenalex-snapshot
Low-complexity aggregation in GraphLog and Datalog
inferredcites →https://doi.org/10.1016/b978-1-4832-1313-2.50038-xopenalex-snapshot
Non-Deterministic Choice in Datalog
inferredcites →https://doi.org/10.1145/103418.103444openalex-snapshot
Generic Computation and its complexity
inferredcites →https://doi.org/10.1145/113413.113427openalex-snapshot
Minimum and maximum predicates in logic programming
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/298514.298564openalex-snapshot
The expressive powers of the logic programming semantics (extended abstract)
inferredcites →https://doi.org/10.1145/3979.3980openalex-snapshot
Implementation of logical query languages for databases
inferredcites →https://doi.org/10.1145/73721.73755openalex-snapshot
Untyped sets, invention, and computable queries
inferredcites →https://doi.org/10.3233/fi-1991-14307openalex-snapshot
Arithmetic Classification of Perfect Models of Stratified Programs1
inferredcites →https://doi.org/10.5860/choice.26-5107openalex-snapshot
Principles of database and knowledge-base systems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_1256openalex-snapshot
Aggregation: Expressiveness and Containment
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_1256openalex-snapshot
Aggregation: Expressiveness and Containment
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_1256-2openalex-snapshot
Aggregation: Expressiveness and Containment
inferred← citeshttps://doi.org/10.1007/978-3-031-01854-1openalex-snapshot
Datalog and Logic Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_14openalex-snapshot
Network-Wide Configuration Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_9openalex-snapshot
Logic Programming Languages for Databases and the Web
inferred← citeshttps://doi.org/10.1007/978-3-642-24206-9_16openalex-snapshot
Dedalus: Datalog in Time and Space
inferred← citeshttps://doi.org/10.1007/978-3-662-04138-3_5openalex-snapshot
Multidimensional Data Models and Aggregation
inferred← citeshttps://doi.org/10.1007/bfb0014176openalex-snapshot
Reasoning with aggregation constraints
inferred← citeshttps://doi.org/10.1007/bfb0056001openalex-snapshot
Optimization of logic queries with MIN and MAX predicates
inferred← citeshttps://doi.org/10.1007/s00778-012-0299-1openalex-snapshot
Extending the power of datalog recursion
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/s0306-4379(03)00003-6openalex-snapshot
Description logics with aggregates and concrete domains
inferred← citeshttps://doi.org/10.1017/s1471068413000380openalex-snapshot
A declarative extension of horn clauses, and its significance for datalog and its applications
inferred← citeshttps://doi.org/10.1017/s1471068417000436openalex-snapshot
Fixpoint semantics and optimization of recursive Datalog programs with aggregates
inferred← citeshttps://doi.org/10.1017/s147106841800042xopenalex-snapshot
A datalog-based computational model for coordination-free, data-parallel systems
inferred← citeshttps://doi.org/10.1109/69.761663openalex-snapshot
Dynamic programming in Datalog with aggregates
inferred← citeshttps://doi.org/10.1109/cluster52292.2023.00024openalex-snapshot
Communication-Avoiding Recursive Aggregation
inferred← citeshttps://doi.org/10.1109/icde.2015.7113340openalex-snapshot
Optimizing recursive queries with monotonic aggregates in DeALS
inferred← citeshttps://doi.org/10.1109/lics.1999.782583openalex-snapshot
Logics with aggregate operators
inferred← citeshttps://doi.org/10.1145/2206869.2206879openalex-snapshot
Query languages for graph databases
inferred← citeshttps://doi.org/10.1145/3639257openalex-snapshot
Optimizing Distributed Protocols with Query Rewrites
inferred← citeshttps://doi.org/10.1145/502090.502100openalex-snapshot
Logics with aggregate operators
inferred← citeshttps://doi.org/10.14778/2536274.2536290openalex-snapshot
Graph queries in a next-generation Datalog system
inferred← citeshttps://doi.org/10.21236/ada538767openalex-snapshot
Dedalus: Datalog in Time and Space
inferred← citeshttps://doi.org/10.2200/s00648ed1v01y201505dtm041openalex-snapshot
Datalog and Logic Databases
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.