{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:02:14Z","timestamp":1740135734860,"version":"3.37.3"},"reference-count":4,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2018,9,5]],"date-time":"2018-09-05T00:00:00Z","timestamp":1536105600000},"content-version":"unspecified","delay-in-days":4,"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":[[2018,9]]},"abstract":"<jats:p>Declarative languages offer unprecedented opportunities for the use of parallelism to speed up execution. A declarative language, being not procedural, removes the need to perform operations in a strict order and reduces the number of dependencies among operations, thus opening the doors for concurrent execution. The potential for transparent exploitation of parallelism in logic programming emerged almost immediately with the birth of the paradigm (Pollard 1981).<\/jats:p>","DOI":"10.1017\/s1471068418000406","type":"journal-article","created":{"date-parts":[[2018,9,5]],"date-time":"2018-09-05T05:16:50Z","timestamp":1536124610000},"page":"722-724","source":"Crossref","is-referenced-by-count":1,"title":["Past and present (and future) of parallel and distributed computation in (constraint) logic programming"],"prefix":"10.1017","volume":"18","author":[{"given":"FERDINANDO","family":"FIORETTO","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7753-1737","authenticated-orcid":false,"given":"ENRICO","family":"PONTELLI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2018,9,5]]},"reference":[{"key":"S1471068418000406_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63516-3_5"},{"key":"S1471068418000406_ref4","unstructured":"Pollard G. H. 1981. Parallel Execution of Horn Clause Programs. PhD Thesis, Department of Computing, Imperial College, London."},{"key":"S1471068418000406_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63516-3_7"},{"key":"S1471068418000406_ref2","doi-asserted-by":"publisher","DOI":"10.1145\/504083.504085"}],"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\/S1471068418000406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T16:56:04Z","timestamp":1555174564000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068418000406\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":4,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["S1471068418000406"],"URL":"https:\/\/doi.org\/10.1017\/s1471068418000406","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2018,9]]}}}