On the public citation graph
Weaker Forms of Monotonicity for Declarative Networking
0 signed · 52 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/inco.1998.2734openalex-snapshot
The Expressive Power of Stratified Logic Programs with Value Invention
inferredcites →https://doi.org/10.1006/jcss.2000.1708openalex-snapshot
Relational Transducers for Electronic Commerce
inferredcites →https://doi.org/10.1007/978-3-642-11503-5_9openalex-snapshot
Netlog, a Rule-Based Language for Distributed Programming
inferredcites →https://doi.org/10.1007/978-3-642-24206-9_16openalex-snapshot
Dedalus: Datalog in Time and Space
inferredcites →https://doi.org/10.1007/s00224-016-9719-8openalex-snapshot
Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data
inferredcites →https://doi.org/10.1007/s00778-007-0049-yopenalex-snapshot
The Active XML project: an overview
inferredcites →https://doi.org/10.1016/0022-0000(93)90022-oopenalex-snapshot
Algebraic and calculus query languages for recursively typed complex objects
inferredcites →https://doi.org/10.1016/0743-1066(93)90040-nopenalex-snapshot
Equivalence of Datalog queries is undecidable
inferredcites →https://doi.org/10.1016/j.jcss.2006.10.006openalex-snapshot
Specification and verification of data-driven Web applications
inferredcites →https://doi.org/10.1109/icde.2014.6816639openalex-snapshot
Blazes: Coordination analysis for distributed programs
inferredcites →https://doi.org/10.1109/lics.2003.1210071openalex-snapshot
Homomorphism closed vs. existential positive
inferredcites →https://doi.org/10.1137/060658709openalex-snapshot
Preservation under Extensions on Well-Behaved Finite Structures
inferredcites →https://doi.org/10.1145/1065167.1065214openalex-snapshot
Diagnosis of asynchronous discrete event systems
inferredcites →https://doi.org/10.1145/1142351.1142364openalex-snapshot
Verification of communicating data-driven web services
inferredcites →https://doi.org/10.1145/1739041.1739056openalex-snapshot
Optimizing joins in a map-reduce environment
inferredcites →https://doi.org/10.1145/1951365.1951367openalex-snapshot
Map-reduce extensions and recursive queries
inferredcites →https://doi.org/10.1145/1989284.1989310openalex-snapshot
Parallel evaluation of conjunctive queries
inferredcites →https://doi.org/10.1145/1989284.1989320openalex-snapshot
A rule-based language for web data management
inferredcites →https://doi.org/10.1145/2247596.2247613openalex-snapshot
Transitive closure and recursive Datalog implemented on clusters
inferredcites →https://doi.org/10.1145/2274576.2274587openalex-snapshot
Deciding eventual consistency for a simple class of relational transducer networks
inferredcites →https://doi.org/10.1145/2274576.2274588openalex-snapshot
Win-move is coordination-free (sometimes)
inferredcites →https://doi.org/10.1145/2391229.2391230openalex-snapshot
Logic and lattices for distributed programming
inferredcites →https://doi.org/10.1145/2450142.2450151openalex-snapshot
Relational transducers for declarative networking
inferredcites →https://doi.org/10.1145/2463664.2465224openalex-snapshot
Communication steps for parallel query processing
inferredcites →https://doi.org/10.1145/2594538.2594541openalex-snapshot
Weaker forms of monotonicity for declarative networking
inferredcites →https://doi.org/10.1145/275487.275507openalex-snapshot
Relational transducers for electronic commerce
inferredcites →https://doi.org/10.1145/298514.298542openalex-snapshot
On the expressive power of datalog
inferredcites →https://doi.org/10.1145/3022743openalex-snapshot
Datalog Queries Distributing over Components
inferredcites →https://doi.org/10.1145/375551.375557openalex-snapshot
Dynamically distributed query evaluation
inferredcites →https://doi.org/10.2307/2964569openalex-snapshot
A counterexample to a conjecture of Scott and Suppes
inferredcites →https://doi.org/10.48550/arxiv.1202.0242openalex-snapshot
Weak Forms of Monotonicity and Coordination-Freeness
inferredcites →https://doi.org/10.5441/002/icdt.2014.12openalex-snapshot
Deciding Correctness with Fairness for Simple Transducer Networks
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-3-319-90050-6_20openalex-snapshot
A Framework for Comparing Query Languages in Their Ability to Express Boolean Queries
inferred← citeshttps://doi.org/10.1007/s10472-019-09639-5openalex-snapshot
A framework for comparing query languages in their ability to express boolean queries
inferred← citeshttps://doi.org/10.1016/j.is.2026.102691openalex-snapshot
A Generalized CALM Theorem for Non-Deterministic Computation in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1017/s1471068419000358openalex-snapshot
A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation
inferred← citeshttps://doi.org/10.1109/lics.2017.8005122openalex-snapshot
The primitivity of operators in the algebra of binary relations under conjunctions of containments
inferred← citeshttps://doi.org/10.1145/2902251.2902307openalex-snapshot
Logical Aspects of Massively Parallel and Distributed Systems
inferred← citeshttps://doi.org/10.1145/3022743openalex-snapshot
Datalog Queries Distributing over Components
inferred← citeshttps://doi.org/10.1145/3584372.3588657openalex-snapshot
Distributed Consistency Beyond Queries
inferred← citeshttps://doi.org/10.1145/3776683openalex-snapshot
Arbitration-Free Consistency Is Available (and Vice Versa)
inferred← citeshttps://doi.org/10.48550/arxiv.1901.01930openalex-snapshot
Keeping CALM: When Distributed Consistency is Easy
inferred← citeshttps://doi.org/10.5555/3329995.3330057openalex-snapshot
The primitivity of operators in the algebra of binary relations under conjunctions of containments
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.