Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/21332
Title: | Putting logic-based distributed systems on stable grounds | Authors: | AMELOOT, Tom VAN DEN BUSSCHE, Jan Marczak, William R. Alvaro, Peter Hellerstein, Joseph M. |
Issue Date: | 2016 | Source: | THEORY AND PRACTICE OF LOGIC PROGRAMMING 16(4), p. 378-417 | 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. | Notes: | Ameloot, TJ (reprint author), Hasselt, Comp Sci, Limburg, Belgium. tom.ameloot@uhasselt.be; jan.vandenbussche@uhasselt.be; wrm@cs.berkeley.edu; palvaro@cs.berkeley.edu; hellerstein@cs.berkeley.edu | Keywords: | Dedalus; Datalog; stable model semantics; distributed system; asynchronous communication | Document URI: | http://hdl.handle.net/1942/21332 | ISSN: | 1471-0684 | e-ISSN: | 1475-3081 | DOI: | 10.1017/S1471068415000381 | ISI #: | 000386588500001 | Category: | A1 | Type: | Journal Contribution | Validations: | ecoom 2017 |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
main_arXiv.pdf | Non Peer-reviewed author version | 1.03 MB | Adobe PDF | View/Open |
SCOPUSTM
Citations
1
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
2
checked on Oct 13, 2024
Page view(s)
74
checked on Sep 5, 2022
Download(s)
116
checked on Sep 5, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.