Putting logic-based distributed systems on stable grounds

DOI10.1017/S1471068415000381MaRDI QIDQ4593035zbMATH OpenOpenAlexFDO

Authors Tom J. Ameloot, Jan Van den Bussche, William R. Marczak, Peter Alvaro, Joseph M. Hellerstein

Publication date 9 November 2017

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1507.05539

zbMATH Keywords

asynchronous communicationDatalogDedalusdistributed systemstable model semantics

Mathematics Subject Classification ID

Logic programming (68N17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Abstract: In the Declarative Networking paradigm, Datalog-like languages are used to express distributed computations. Whereas recently formal operational semantics for these languages have been developed, a corresponding declarative semantics has been lacking so far. The challenge is to capture precisely the amount of nondeterminism that is inherent to distributed computations due to concurrency, networking delays, and asynchronous communication. This paper shows how a declarative, model-based semantics can be obtained by simply using the well-known stable model semantics for Datalog with negation. We show that the model-based semantics matches previously proposed formal operational semantics.

Recommendations

• Declarative distributed computing
• A declarative approach to distributed computing: specification, execution and analysis
• Distributed Logic Programming
• Semantic models for concurrent logic languages
• Maintaining distributed logic programs incrementally

Cites work

• A declarative approach to distributed computing: specification, execution and analysis
• Adding Evolving Abilities to a Multi-Agent System
• Appraising fairness in languages for distributed programming
• Datalog reloaded. First international workshop, Datalog 2010, Oxford, UK, March 16--19, 2010. Revised selected papers
• Declarative distributed computing
• Fairness and hyperfairness
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 3972158 (Why is no real title available?)
• scientific article; zbMATH DE number 605917 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• scientific article; zbMATH DE number 2088155 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Logic programming and negation: A survey
• LUPS -- A language for updating logic programs
• Modeling in Event B. System and software engineering.
• Positive Dedalus programs tolerate non-causality
• Relational transducers for declarative networking

Cited in

(9)

• Positive Dedalus programs tolerate non-causality
• A Distributed Logic for Networked Cyber-Physical Systems
• Declarative distributed computing
• Applying prolog to develop distributed systems
• Cardinality Abstraction for Declarative Networking Applications
• scientific article; zbMATH DE number 4070296 (Why is no real title available?)
• Maintaining distributed logic programs incrementally
• Relational transducers for declarative networking
• A declarative approach to distributed computing: specification, execution and analysis

Describes a project that uses

Uses Software

• Rodin
• LUPS
• Z

This page was built for publication: Putting logic-based distributed systems on stable grounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593035)