{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T19:39:58Z","timestamp":1757705998534},"reference-count":25,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"content-version":"unspecified","delay-in-days":86,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2013,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>There is an increasing interest in using logic programming to specify and implement distributed algorithms, including a variety of network applications. These are applications where data and computation are distributed among several devices and where, in principle, all the devices can exchange data and share the computational results of the group. In this paper we propose a declarative approach to distributed computing whereby distributed algorithms and communication models can be (i) specified as action theories of fluents and actions; (ii) executed as collections of distributed state machines, where devices are abstracted as (input\/output) automata that can exchange messages; and (iii) analysed using existing results on connecting causal theories and Answer Set Programming. Results on the application of our approach to different classes of network protocols are also presented.<\/jats:p>","DOI":"10.1017\/s1471068413000513","type":"journal-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T16:24:58Z","timestamp":1380126298000},"page":"815-830","source":"Crossref","is-referenced-by-count":9,"title":["A declarative approach to distributed computing: Specification, execution and analysis"],"prefix":"10.1017","volume":"13","author":[{"given":"JIEFEI","family":"MA","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FRANCK","family":"LE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAVID","family":"WOOD","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALESSANDRA","family":"RUSSO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JORGE","family":"LOBO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"S1471068413000513_ref23","first-page":"283","volume-title":"Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'12)","author":"Wang","year":"2012"},{"key":"S1471068413000513_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00058-2"},{"key":"S1471068413000513_ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"S1471068413000513_ref16","first-page":"723","volume-title":"Proceedings of the 2010 International Conference on Management of Data","author":"Marczak","year":"2010"},{"key":"S1471068413000513_ref13","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000360"},{"key":"S1471068413000513_ref10","unstructured":"Lobo J. , Ma J. , Russo A. and Le F. 2012. Declarative distributed computing. In Correct Reasoning, 454\u2013470."},{"key":"S1471068413000513_ref6","first-page":"193","article-title":"Action languages.","volume":"2","author":"Gelfond","year":"1998","journal-title":"Electronic Transactions on Artificial Intelligence"},{"key":"S1471068413000513_ref4","unstructured":"Baral C. , Gelfond G. , Son T. C. and Pontelli E. 2010. Using answer set programming to model multi-agent scenarios involving agents' knowledge about other's knowledge. In AAMAS, 259\u2013266."},{"key":"S1471068413000513_ref20","unstructured":"Pontelli E. , Son T. C. , Baral C. and Gelfond G. 2012. Answer set programming and planning with knowledge and world-altering actions in multiple agent domains. In Correct Reasoning, 509\u2013526."},{"key":"S1471068413000513_ref19","unstructured":"P\u00e9rez J. A. N. and Rybalchenko A. 2009. Operational semantics for declarative networking. In PADL, 76\u201390."},{"key":"S1471068413000513_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24206-9_15"},{"key":"S1471068413000513_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068413000513_ref9","first-page":"274","volume-title":"Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)","author":"Krennwallner","year":"2011"},{"key":"S1471068413000513_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-010-0150-7"},{"key":"S1471068413000513_ref14","volume-title":"Distributed Algorithms","author":"Lynch","year":"1996"},{"key":"S1471068413000513_ref18","unstructured":"Musuvathi M. and Engler D. R. 2004. Model checking large network protocol implementations. In NSDI, 440\u2013441."},{"key":"S1471068413000513_ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1592761.1592785"},{"key":"S1471068413000513_ref2","unstructured":"Alvaro P. , Ameloot T. J. , Hellerstein J. M. , Marczak W. R. and den Bussche J. V. 2011. A declarative semantics for dedalus. Tech. Rep. UCB\/EECS-2011-120, UC Berkley."},{"key":"S1471068413000513_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2002.12.001"},{"key":"S1471068413000513_ref25","first-page":"1323","volume-title":"Proceedings of the 2011 international conference on Management of data","author":"Zhou","year":"2011"},{"key":"S1471068413000513_ref11","unstructured":"Lobo J. , Wood D. , Verma D. C. and Calo S. B. 2012. Distributed state machines: A declarative framework for the management of distributed systems. In CNSM, 224\u2013228."},{"key":"S1471068413000513_ref24","unstructured":"Zhang L. , Estrin D. , Burke J. , Jacobson V. , Thornton J. D. , Smetters D. K. , Zhang B. , Tsudik G. , Massey D. , Papadopoulos C. et al., 2010. Named data networking (ndn) project. Relat\u00f3rio T\u00e9cnico NDN-0001, Xerox Palo Alto Research Center-PARC."},{"key":"S1471068413000513_ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1713254.1713260"},{"key":"S1471068413000513_ref8","unstructured":"Grumbach S. and Wang F. 2010. Netlog, a rule-based language for distributed programming. In PADL, 88\u2013103."},{"key":"S1471068413000513_ref21","unstructured":"Sobrinho J. L. and Griffin T. G. 2010. Routing in equilibrium. In Mathematical Theory of Networks and System."}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068413000513","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T09:29:02Z","timestamp":1715592542000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068413000513\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":25,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["S1471068413000513"],"URL":"https:\/\/doi.org\/10.1017\/s1471068413000513","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}