In recent years there has been interest in achieving application-level consistency criteria
without the latency and availability costs of strongly consistent storage infrastructure. A …

In large-scale data management systems, failure is practically a certainty. Fault-tolerant
protocols and components are notoriously difficult to implement and debug. Worse still …

Distributed consistency is perhaps the most discussed topic in distributed systems today.
Coordination protocols can ensure consistency, but in practice they cause undesirable …

Distributed consistency is a perennial research topic; in recent years it has become an
urgent practical matter as well. The research literature has focused on enforcing various …

Systematically reasoning about the fine-grained causes of events in a real-world distributed
system is challenging. Causality, from the distributed systems literature, can be used to …

Existential rules are Datalog rules extended with existential quantifiers in rule-heads. Three
fundamental restriction paradigms that have been studied for ensuring decidability of query …

The field of logic and databases is an outgrowth of work in logic programming and
databases. It is assumed that the reader is familiar with work in relational databases as …

Declarative Networking Page 1 Declarative Networking: Recent Theoretical Work on
Coordination, Correctness, and Declarative Semantics∗ Tom J. Ameloot † Hasselt …

Networks of relational transducers can serve as a formal model for declarative networking,
focusing on distributed database querying applications. In declarative networking, a crucial …

Distributed systems are difficult to reason about and program because of fundamental
uncertainty in their executions, arising from sources of nondeterminism such as asynchrony …