Positive Dedalus programs tolerate non-causality
From MaRDI portal
Publication:2453541
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
- scientific article; zbMATH DE number 3972158 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- A logic programming approach to knowledge-state planning, semantics and complexity
- Appraising fairness in languages for distributed programming
- Datalog LITE
- Datalog extensions for database queries and updates
- Declarative distributed computing
- Depth-bounded bottom-up evaluation of logic programs
- Fairness and hyperfairness
- Fundamental properties of deterministic and nondeterministic extensions of Datalog
- Relational transducers for declarative networking
- Temporal stratification tests for linear and branching-time deductive databases
Cited in
(3)
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)