On the CRON Conjecture.
Datalog 2.0'12: Proceedings of the Second international conference on Datalog in Academia and Industry(2012)
摘要
Declarative networking is a recent approach to programming distributed applications with languages inspired by Datalog. A recent conjecture posits that the delivery of messages should respect causality if and only if they are used in non-monotone derivations. We present our results about this conjecture in the context of Dedalus, a Datalog-variant for distributed programming. We show that both directions of the conjecture fail under a strong semantical interpretation. But on a more syntactical level, we can show 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.
更多查看译文
关键词
Active Node, Operational Semantic, Database Schema, Inductive Rule, Database Instance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络