Win-Move is Coordination-Free (Sometimes)

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 99-113

  Zinn, Daniel ^a   Green, Todd J ^a,b   Ludäscher, Bertram ^b  

^a LOGICBLOX INC   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Datalog; Distribution; Monotonicity; Relational transducer

Indexed keywords

DATALOG; DECLARATIVE NETWORKINGS; DISTRIBUTED COMPUTATIONS; DISTRIBUTION; MONOTONICITY; NETWORK MODELS; NETWORK PROGRAMMING LANGUAGE; WELL FOUNDED SEMANTICS;

DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; SEMANTICS;

TRANSDUCERS;

EID: 84863910602     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2274576.2274588     Document Type: Conference Paper

References (24)

1. S. Abiteboul, M. Bienvenu, A. Galland, and É. Antoine. A rule-based language for web data management. In Proceedings of the 30th symposium on Principles of database systems of data, pages 293-304. ACM, 2011.
2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
3. S. Abiteboul and E. Simon. Fundamental properties of deterministic and nondeterministic extensions of datalog. Theor. Comput. Sci., 78(1):137-158, 1991.
4. S. Abiteboul, E. Simon, and V. Vianu. Non-deterministic languages to express deterministic transformations. In PODS, 1990.
5. S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. J. Comput. Syst. Sci., 43:62-124, August 1991.
6. S. Abiteboul, V. Vianu, B. Fordham, and Y. Yesha. Relational transducers for electronic commerce. In PODS, pages 179-187. ACM, 1998.
7. P. Alvaro, N. Conway, J. Hellerstein, and W. Marczak. Consistency analysis in bloom: a calm and collected approach. In CIDR, 2011.
8. T. J. Ameloot and J. V. den Bussche. Deciding eventual consistency for a simple class of relational transducer networks. In ICDT, 2012.
9. T. J. Ameloot, F. Neven, and J. Van den Bussche. Relational transducers for declarative networking. In PODS, 2011.
10. S. Brass, J. Dix, B. Freitag, and U. Zukowski. Transformation-based bottom-up computation of the well-founded model. TPLP, 1(5):497-538, 2001.
11. F. Bry. Logic programming as constructivism: a formalization and its application to databases. In PODS, 1989.
12. P. M. Dung and K. Kanchanasut. A natural semantics for logic programs with negation. In Foundations of Software Technology and Theoretical Computer Science, LNCS 405, pages 78-88, 1989.
13. J. Flum, M. Kubierschky, and B. Ludäscher. Total and partial well-founded datalog coincide. In ICDT, 1997.
14. A. V. Gelder. The alternating fixpoint of logic programs with negation. JCSS, 47(1):185 - 221, 1993.
15. J. M. Hellerstein. The declarative imperative: experiences and conjectures in distributed logic. SIGMOD Record, 39, March 2010.
16. D. B. Kemp, D. Srivastava, and P. J. Stuckey. Bottom-up evaluation and query optimization of well-founded models. TCS, 146:145-184, 1995.
17. P. Kolaitis. The expressive power of stratified logic programs. Information and Computation, 90(1):50-66, Jan. 1991.
18. P. Koutris and D. Suciu. Parallel evaluation of conjunctive queries. In PODS, 2011.
19. B. T. Loo, T. Condie, M. N. Garofalakis, D. E. Gay, J. M. Hellerstein, P. Maniatis, R. Ramakrishnan, T. Roscoe, and I. Stoica. Declarative networking. CACM, 52(11), 2009.
20. P. Overby. SuperPACs, candidates: Dancing solo or together? In National Public Radio. January 6, 2012. http://www.npr.org/2012/01/06/144801659/a-look- at-super-pacs-and-political-coordination.
21. O. Shmueli. Equivalence of datalog queries is undecidable. J. Logic Programming, 15(3), 1993.
22. A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. J. ACM, 38:619-649, July 1991.
23. V. Vianu. Rule-based languages. Annals of Mathematics and Artificial Intelligence, 19(1-2):215-259, 1997.
24. U. Zukowski and B. Freitag. The differential fixpoint of general logic programs. In DDLP, pages 45-56, 1996.