# Weaker Forms of Monotonicity for Declarative Networking

@article{Ameloot2016WeakerFO, title={Weaker Forms of Monotonicity for Declarative Networking}, author={Tom J. Ameloot and Bas Ketsman and Frank Neven and Daniel Zinn}, journal={ACM Transactions on Database Systems (TODS)}, year={2016}, volume={40}, pages={1 - 45} }

The CALM-conjecture, first stated by Hellerstein [2010] and proved in its revised form by Ameloot et al. [2013] within the framework of relational transducer networks, asserts that a query has a coordination-free execution strategy if and only if the query is monotone. Zinn et al. [2012] extended the framework of relational transducer networks to allow for specific data distribution strategies and showed that the nonmonotone win-move query is coordination-free for domain-guided data…

## 23 Citations

Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture

- Computer Science
- 2016

Equating increasingly larger classes of coordination-free computations with increasingly weaker forms of monotonicity and present explicit Datalog variants that capture each of these classes can be interpreted as a more fine-grained answer to the CALM-conjecture.

How to stay CALM while seeing what is not there

- Computer Science
- 2014

Two revisions of the CALM-conjecture are covered, showing that queries computing in a coordination-free way within these settings relate to increasingly weaker notions of monotonicity, and providing an effective syntax for these otherwise undecidable classes.

Datalog Queries Distributing over Components

- Computer Science, MathematicsACM Trans. Comput. Log.
- 2017

It is shown that connected Datalog¬ (the fragment of DatalOG¬ where all rules are connected) provides an effective syntax for Datalogs programs that distribute over components under the stratified as well as under the well-founded semantics.

On the CALM Principle for BSP Computation

- Computer ScienceAMW
- 2015

This paper sketches how, using novel techniques, the satisfiability of the if direction of the CALM principle can still be obtained, although just for a subclass of monotonic queries.

Additive first-order queries

- Computer Science
- 2018

This work defines the “connected formulas” as a syntactic fragment of first-order logic, and shows that a first- order query is additive if and only if it expressible by a connected formula.

Datalog with Negation and Monotonicity

- Computer ScienceICDT
- 2020

It is shown that monotone queriesexpressible in semi-positive Datalog exist which are not expressible in positive Datalogy, and best-effort techniques to reduce the amount of negation that is exhibited by a program, even if the program is not monotones.

Additive First-Order Queries

- Computer ScienceICDT
- 2019

This work defines the "connected formulas" as a syntactic fragment of first- order logic, and shows that a first-order query is additive if and only if it is expressible by a connected formula.

Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data

- Computer ScienceTheory of Computing Systems
- 2016

The notion of broadcast dependency set is introduced as a sound and complete formalism to represent locally optimal oblivious broadcasting functions and algorithms to construct a BDS for a given conjunctive query are provided.

A datalog-based computational model for coordination-free, data-parallel systems

- Computer ScienceTheory and Practice of Logic Programming
- 2018

The case is made that the current form of CALM does not hold in general for data-parallel systems, and how, using novel techniques, the satisfiability of the CALM principle can still be obtained although just for the subclass of programs called connected monotonic queries.

Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation

- Computer ScienceACM Trans. Comput. Log.
- 2019

It is shown that the containment problem for conjunctive queries with negation is coNEXPTIME-complete and the study of the complexity of parallel-correctness and its constituents, parallel-soundness and parallel-completeness is extended.

## References

SHOWING 1-10 OF 46 REFERENCES

Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture

- Computer Science
- 2016

Equating increasingly larger classes of coordination-free computations with increasingly weaker forms of monotonicity and present explicit Datalog variants that capture each of these classes can be interpreted as a more fine-grained answer to the CALM-conjecture.

Win-move is coordination-free (sometimes)

- Computer ScienceICDT '12
- 2012

It is shown the surprising result that the query given by the well-founded semantics of the unstratifiable win-move program is coordination-free in some of the models the authors consider, and it is shown that the original transducer network model and variants form a strict hierarchy of classes of coordination- free queries.

Relational transducers for declarative networking

- Computer ScienceJACM
- 2013

A formal definition of coordination-freeness is proposed and it is confirmed that the class of monotone queries is captured by coordination-free transducer networks.

Datalog Queries Distributing over Components

- Computer Science, MathematicsACM Trans. Comput. Log.
- 2017

It is shown that connected Datalog¬ (the fragment of DatalOG¬ where all rules are connected) provides an effective syntax for Datalogs programs that distribute over components under the stratified as well as under the well-founded semantics.

On the CRON Conjecture

- Computer ScienceDatalog
- 2012

It is shown that positive Dedalus programs can tolerate non-causal messages, in the sense that they compute the correct answer when messages can be sent into the past.

Logic and lattices for distributed programming

- Computer ScienceSoCC '12
- 2012

This paper generalizes Bloom to support lattices and extends the power of CALM analysis to whole programs containing arbitrary lattices, and shows how the Bloom interpreter can be generalized to support efficient evaluation of lattice-based code using well-known strategies from logic programming.

Deciding eventual consistency for a simple class of relational transducer networks

- Computer ScienceICDT '12
- 2012

It is shown that eventual consistency is decidable when the transducers satisfy some syntactic restrictions, some of which have also been considered in earlier work on automated verification of relational transducers.

Weak Forms of Monotonicity and Coordination-Freeness

- MathematicsArXiv
- 2012

This paper further characterize the classes of queries that can be distributedly computed in a coordination-free manner by revealing a tight relationship between them and novel weakened forms of monotonicity.

The declarative imperative: experiences and conjectures in distributed logic

- Computer ScienceSGMD
- 2010

A case for database researchers to take a leadership role in addressing the impending programming crisis is made and a number of theoretical conjectures are presented that may both interest the database community, and clarify important practical issues in distributed computing.

Transitive closure and recursive Datalog implemented on clusters

- Computer ScienceEDBT '12
- 2012

It is proved it is possible to implement any Datalog program of right-linear chain rules with a logarithmic number of rounds and no order-of-magnitude increase in the number of facts deduced, and it is shown that the reachability problem cannot be solved in logarithsmic rounds without using a binary predicate, thus squaring thenumber of potential facts to be deduced.