{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T23:29:55Z","timestamp":1707521395427},"reference-count":28,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T00:00:00Z","timestamp":1405900800000},"content-version":"unspecified","delay-in-days":20,"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":[[2014,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We have designed a new logic programming language called LM (Linear Meld) for programming graph-based algorithms in a declarative fashion. Our language is based on linear logic, an expressive logical system where logical facts can be consumed. Because LM integrates both classical and linear logic, LM tends to be more expressive than other logic programming languages. LM programs are naturally concurrent because facts are partitioned by nodes of a graph data structure. Computation is performed at the node level while communication happens between connected nodes. In this paper, we present the syntax and operational semantics of our language and illustrate its use through a number of examples.<\/jats:p>","DOI":"10.1017\/s1471068414000167","type":"journal-article","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T11:52:50Z","timestamp":1405943570000},"page":"493-507","source":"Crossref","is-referenced-by-count":7,"title":["A Linear Logic Programming Language for Concurrent Programming over Graph Structures"],"prefix":"10.1017","volume":"14","author":[{"given":"FLAVIO","family":"CRUZ","sequence":"first","affiliation":[]},{"given":"RICARDO","family":"ROCHA","sequence":"additional","affiliation":[]},{"given":"SETH COPEN","family":"GOLDSTEIN","sequence":"additional","affiliation":[]},{"given":"FRANK","family":"PFENNING","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,7,21]]},"reference":[{"key":"S1471068414000167_ref1","doi-asserted-by":"crossref","unstructured":"Alvaro P. , Marczak W. , Conway N. , Hellerstein J. M. , Maier D. , and Sears R. C. 2009. Dedalus: Datalog in time and space. Tech. Rep. UCB\/EECS-2009-173, EECS Department, University of California, Berkeley. Dec.","DOI":"10.21236\/ADA538767"},{"key":"S1471068414000167_ref27","doi-asserted-by":"crossref","unstructured":"Watkins K. , Cervesato I. , Pfenning F. , and Walker D. 2003. A concurrent logical framework i: Judgments and properties. Tech. rep.","DOI":"10.21236\/ADA418517"},{"key":"S1471068414000167_ref20","unstructured":"Low Y. , Gonzalez J. , Kyrola A. , Bickson D. , Guestrin C. , and Hellerstein J. M. 2010. Graphlab: A new framework for parallel machine learning. In Conference on Uncertainty in Artificial Intelligence (UAI). 340\u2013349."},{"key":"S1471068414000167_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"S1471068414000167_ref28","unstructured":"Watkins K. , Cervesato I. , Pfenning F. , and Walker D. 2004. A concurrent logical framework: The propositional fragment. In Types for Proofs and Programs. Lecture Notes in Computer Science, vol. 3085. 355\u2013377."},{"key":"S1471068414000167_ref10","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1273920.1273924","volume-title":"Proceedings of the 9th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming","author":"De Koninck","year":"2007"},{"key":"S1471068414000167_ref14","unstructured":"Gonzalez J. , Low Y. , and Guestrin C. 2009. Residual splash for optimally parallelizing belief propagation. In Artificial Intelligence and Statistics (AISTATS)."},{"key":"S1471068414000167_ref25","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000438"},{"key":"S1471068414000167_ref18","doi-asserted-by":"crossref","unstructured":"Loo B. T. , Condie T. , Garofalakis M. , Gay D. E. , and Hellerstein J. M. 2006. Declarative networking: Language, execution and optimization. In International Conference on Management of Data (SIGMOD). 97\u2013108.","DOI":"10.1145\/1142473.1142485"},{"key":"S1471068414000167_ref17","doi-asserted-by":"crossref","unstructured":"Isard M. , Budiu M. , Yu Y. , Birrell A. , and Fetterly D. 2007. Dryad: distributed data-parallel programs from sequential building blocks. In European Conference on Computer Systems (EuroSys). 59\u201372.","DOI":"10.1145\/1272996.1273005"},{"key":"S1471068414000167_ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2422085.2422086"},{"key":"S1471068414000167_ref3","unstructured":"Ashley-Rollman M. P. , Rosa M. D. , Srinivasa S. S. , Pillai P. , Goldstein S. C. , and Campbell J. D. 2007. Declarative programming for modular robots. In Workshop on Self-Reconfigurable Robots\/Systems and Applications at IROS 2007."},{"key":"S1471068414000167_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"S1471068414000167_ref26","unstructured":"Ullman J. D. 1990. Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies."},{"key":"S1471068414000167_ref12","doi-asserted-by":"crossref","unstructured":"Ehrig H. and Padberg J. 2004. Graph grammars and petri net transformations. In Lectures on Concurrency and Petri Nets. Lecture Notes in Computer Science, vol. 3098. 496\u2013536.","DOI":"10.1007\/978-3-540-27755-2_14"},{"key":"S1471068414000167_ref16","doi-asserted-by":"publisher","DOI":"10.2307\/2689192"},{"key":"S1471068414000167_ref2","doi-asserted-by":"crossref","unstructured":"Ashley-Rollman M. P. , Lee P. , Goldstein S. C. , Pillai P. , and Campbell J. D. 2009. A language for large ensembles of independently executing nodes. In International Conference on Logic Programming (ICLP).","DOI":"10.1007\/978-3-642-02846-5_24"},{"key":"S1471068414000167_ref9","doi-asserted-by":"crossref","unstructured":"Cervesato I. , Pfenning F. , Walker D. , and Watkins K. 2002. A concurrent logical framework ii: Examples and applications. Tech. rep.","DOI":"10.21236\/ADA418538"},{"key":"S1471068414000167_ref24","unstructured":"Page L. 2001. Method for node ranking in a linked database. US Patent 6,285,999. Filed January 9, 1998. Expires around January 9, 2018."},{"key":"S1471068414000167_ref19","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/1069774.1069778","volume-title":"Proceedings of the 7th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming","author":"L\u00f3pez","year":"2005"},{"key":"S1471068414000167_ref22","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/2.3.297"},{"key":"S1471068414000167_ref4","unstructured":"Baader F. and Siekmann J. H. 1994. Handbook of logic in artificial intelligence and logic programming. Oxford University Press, Inc., New York, NY, USA, Chapter Unification Theory, 41\u2013125."},{"key":"S1471068414000167_ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2071368.2071370"},{"key":"S1471068414000167_ref15","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1036"},{"key":"S1471068414000167_ref23","unstructured":"Miller D. 1985. An overview of linear logic programming. In Computational Logic. 1\u20135."},{"key":"S1471068414000167_ref21","doi-asserted-by":"crossref","unstructured":"Malewicz G. , Austern M. H. , Bik A. J. C. , Dehnert J. C. , Horn I. , Leiser N. , and Czajkowski G. 2010. Pregel: a system for large-scale graph processing. In International Conference on Management of Data (SIGMOD). 135\u2013146.","DOI":"10.1145\/1807167.1807184"},{"key":"S1471068414000167_ref6","unstructured":"Betz H. and Fr\u00fchwirth T. 2005. A linear-logic semantics for constraint handling rules. In Principles and Practice of Constraint Programming - CP 2005. Lecture Notes in Computer Science, vol. 3709. 137\u2013151."},{"key":"S1471068414000167_ref8","unstructured":"Betz H. , Raiser F. , and Fr\u00fchwirth T. W. 2010. A complete and terminating execution model for constraint handling rules. CoRR abs\/1007.3829."}],"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\/S1471068414000167","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,11]],"date-time":"2022-04-11T19:58:44Z","timestamp":1649707124000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068414000167\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":28,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["S1471068414000167"],"URL":"https:\/\/doi.org\/10.1017\/s1471068414000167","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7]]}}}