On the public citation graph
Dynamic programming in Datalog with aggregates
0 signed · 59 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/jcss.1995.1053openalex-snapshot
The Expressive Powers of the Logic Programming Semantics
inferredcites →https://doi.org/10.1006/jcss.1995.1064openalex-snapshot
Extrema Predicates in Deductive Databases
inferredcites →https://doi.org/10.1006/jcss.1997.1446openalex-snapshot
The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries
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/3-540-57530-8_2openalex-snapshot
Foundations of aggregation in deductive databases
inferredcites →https://doi.org/10.1007/3-540-58907-4_8openalex-snapshot
DATALOG queries with stratified negation and choice: from P to D P
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf01536403openalex-snapshot
How expressive is stratified aggregation?
inferredcites →https://doi.org/10.1007/bfb0056001openalex-snapshot
Optimization of logic queries with MIN and MAX predicates
inferredcites →https://doi.org/10.1016/0022-0000(82)90012-5openalex-snapshot
Structure and complexity of relational queries
inferredcites →https://doi.org/10.1016/0022-0000(91)90032-zopenalex-snapshot
Datalog extensions for database queries and updates
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/0743-1066(93)90048-lopenalex-snapshot
Pushing constraint selections
inferredcites →https://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
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/113413.113427openalex-snapshot
Minimum and maximum predicates in logic programming
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
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/298514.298564openalex-snapshot
The expressive powers of the logic programming semantics (extended abstract)
inferredcites →https://doi.org/10.1145/298514.298572openalex-snapshot
Stable models and non-determinism in logic programs with negation
inferredcites →https://doi.org/10.1145/298514.298575openalex-snapshot
Non-deterministic languages to express deterministic transformations
inferredcites →https://doi.org/10.1145/800070.802186openalex-snapshot
The complexity of relational query languages (Extended Abstract)
inferredcites →https://doi.org/10.5860/choice.27-0349openalex-snapshot
A logical language for data and knowledge bases
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11425274_43openalex-snapshot
Aggregates and Preferences in Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-46767-x_23openalex-snapshot
Stable Model Semantics of Weight Constraint Rules
inferred← citeshttps://doi.org/10.1007/978-1-4615-1567-8_21openalex-snapshot
Extending the Smodels System with Cardinality and Weight Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-33223-5_35openalex-snapshot
HIKE: A Step Beyond Data Exchange
inferred← citeshttps://doi.org/10.1007/978-3-031-01854-1openalex-snapshot
Datalog and Logic Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_6openalex-snapshot
Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP
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_11openalex-snapshot
Dyna: Extending Datalog for Modern AI
inferred← citeshttps://doi.org/10.1007/s13740-020-00115-6openalex-snapshot
Declarative Semantics for P2P Data Management System
inferred← citeshttps://doi.org/10.1016/j.ins.2022.12.116openalex-snapshot
On acceptance conditions in abstract argumentation frameworks
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00187-xopenalex-snapshot
Extending and implementing the stable model semantics
inferred← citeshttps://doi.org/10.1016/s0306-4379(02)00006-6openalex-snapshot
Pushing extrema aggregates to optimize logic queries
inferred← citeshttps://doi.org/10.1017/s1471068401001090openalex-snapshot
Greedy algorithms in Datalog
inferred← citeshttps://doi.org/10.1017/s1471068409990251openalex-snapshot
atalog: A logic language for expressing search and optimization problems
inferred← citeshttps://doi.org/10.1017/s1471068416000077openalex-snapshot
Using linear constraints for logic program termination analysis
inferred← citeshttps://doi.org/10.1093/logcom/exac001openalex-snapshot
Semantic data management in P2P systems driven by self-esteem
inferred← citeshttps://doi.org/10.1145/2076623.2076625openalex-snapshot
Aggregates and priorities in P2P data management systems
inferred← citeshttps://doi.org/10.1145/3649815openalex-snapshot
Finding Cross-Rule Optimization Bugs in Datalog Engines
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33012694openalex-snapshot
Enhancing Lazy Grounding with Lazy Normalization in Answer-Set Programming
inferred← citeshttps://doi.org/10.2200/s00648ed1v01y201505dtm041openalex-snapshot
Datalog and Logic Databases
inferred← citeshttps://doi.org/10.3233/ia-2011-0016openalex-snapshot
A long tour from theory to practice
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2012.425openalex-snapshot
A Flexible Solver for Finite Arithmetic Circuits
inferred← citeshttps://doi.org/10.48550/arxiv.0911.2785openalex-snapshot
NP Datalog: a Logic Language for Expressing NP Search and Optimization Problems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0605038openalex-snapshot
An Unfolding-Based Semantics for Logic Programming with Aggregates
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.