This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
S. Abiteboul , M. Bienvenu , A. Galland , et al.2011. A rule-based language for Web data management. In Proc. 30th ACM Symposium on Principles of Database Systems, ACM Press, New York, NY, USA, 293–304.
J. Abrial 2010. Modeling in Event-B – System and Software Engineering. Cambridge University Press.
J. Alferes , L. Pereira , H. Przymusinska and T. Przymusinski 2002. LUPS–-a language for updating logic programs. Artificial Intelligence 138, 1–2, 87–116.
P. Alvaro , T. Condie , N. Conway , J. Hellerstein and R. Sears 2009. I do declare: Consensus in a logic language. Operating Systems Review 43, 4, 25–30.
T. Ameloot and J. Van den Bussche 2014. Positive Dedalus programs tolerate non-causality. Journal of Computer and System Sciences 80, 7, 1191–1213.
T. Ameloot , F. Neven and J. Van den Bussche 2011. Relational transducers for declarative networking. In Proc. 30th ACM Symposium on Principles of Database Systems, ACM Press, 283–292.
T. Ameloot , F. Neven and J. Van den Bussche 2013. Relational transducers for declarative networking. Journal of the ACM 60, 2, 15:1–15:38.
K. Apt , N. Francez and S. Katz 1988. Appraising fairness in languages for distributed programming. Distributed Computing 2, 226–241.
H. Attiya and J. Welch 2004. Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Wiley.
O. de Moor , G. Gottlob , T. Furche and A. Sellers (Eds.) 2011. Datalog Reloaded: First International Workshop, Datalog 2010, Lecture Notes in Computer Science, Springer-Verlag, Berlin/Heidelberg, Germany, vol. 6702.
N. Francez 1986. Fairness. Springer-Verlag New York, Inc., New York, NY, USA.
J. Hellerstein 2010b. The declarative imperative: Experiences and conjectures in distributed logic. SIGMOD Record 39, 1, 5–19.
S. Huang , T. Green and B. Loo 2011. Datalog and emerging applications: An interactive tutorial. In Proc. of the 2011 ACM SIGMOD International Conference on the Management of Data, SIGMOD ’11, ACM, 1213–1216.
R. Krishnamurthy and S. Naqvi 1988. Non-deterministic choice in Datalog. In Proc. of the 3rd International Conference on Data and Knowledge Bases, Morgan Kaufmann, Burlington, MA, USA, 416–424.
L. Lamport 2000b. Fairness and hyperfairness. Distributed Computing 13, 4, 239–245.
J. Leite , J. Alferes and L. Pereira 2002. Minerva – a dynamic logic programming agent architecture. In Revised Papers from the 8th International Workshop on Intelligent Agents VIII, ATAL, Springer-Verlag, 141–157.
B. Loo et al.2009. Declarative networking. Communications of the ACM 52, 11, 87–95.
J. Navarro and A. Rybalchenko 2009. Operational semantics for declarative networking. In Proceedings 11th International Symposium on Practical Aspects of Declarative Languages, A. Gill and T. Swift , Eds. Lecture Notes in Computer Science, 76–90.
Q. Zhang , L. Cheng and R. Boutaba 2010. Cloud computing: State-of-the-art and research challenges. Journal of Internet Services and Applications 1, 1, 7–18.