Positive Dedalus programs tolerate non-causality
From MaRDI portal
Publication:2453541
DOI10.1016/J.JCSS.2014.01.005zbMATH Open1311.68048OpenAlexW2051261251MaRDI QIDQ2453541FDOQ2453541
Authors: Tom J. Ameloot, Jan Van den Bussche 
Publication date: 10 June 2014
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2014.01.005
Recommendations
- Declarative distributed computing
- Putting logic-based distributed systems on stable grounds
- Relational transducers for declarative networking
- Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the CALM-conjecture
- Deciding confluence for a simple class of relational transducer networks
Cites Work
- Datalog LITE
- Title not available (Why is that?)
- Datalog extensions for database queries and updates
- Relational transducers for declarative networking
- Appraising fairness in languages for distributed programming
- Title not available (Why is that?)
- Fairness and hyperfairness
- A logic programming approach to knowledge-state planning, semantics and complexity
- Fundamental properties of deterministic and nondeterministic extensions of Datalog
- Temporal stratification tests for linear and branching-time deductive databases
- Declarative distributed computing
- Depth-bounded bottom-up evaluation of logic programs
Cited In (2)
Uses Software
This page was built for publication: Positive Dedalus programs tolerate non-causality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453541)
