{"id":"https://openalex.org/W2891023565","doi":"https://doi.org/10.1017/s1471068418000406","title":"Past and present (and future) of parallel and distributed computation in (constraint) logic programming","display_name":"Past and present (and future) of parallel and distributed computation in (constraint) logic programming","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2891023565","doi":"https://doi.org/10.1017/s1471068418000406","mag":"2891023565"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068418000406","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068418000406","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/9CB30AB49665BCDFEBD79B0B0843A475/S1471068418000406a.pdf/div-class-title-past-and-present-and-future-of-parallel-and-distributed-computation-in-constraint-logic-programming-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/9CB30AB49665BCDFEBD79B0B0843A475/S1471068418000406a.pdf/div-class-title-past-and-present-and-future-of-parallel-and-distributed-computation-in-constraint-logic-programming-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052534316","display_name":"Ferdinando Fioretto","orcid":"https://orcid.org/0000-0002-1381-6776"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"FERDINANDO FIORETTO","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI 48109, USA (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI 48109, USA (e-mail:","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024528910","display_name":"Enrico Pontelli","orcid":"https://orcid.org/0000-0002-7753-1737"},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ENRICO PONTELLI","raw_affiliation_strings":["New Mexico State University, Las Cruces, NM 88003, USA (e-mail:"],"raw_orcid":"https://orcid.org/0000-0002-7753-1737","affiliations":[{"raw_affiliation_string":"New Mexico State University, Las Cruces, NM 88003, USA (e-mail:","institution_ids":["https://openalex.org/I10052268"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1638,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.5930052,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"18","issue":"5-6","first_page":"722","last_page":"724"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8779681921005249},{"id":"https://openalex.org/keywords/declarative-programming","display_name":"Declarative programming","score":0.6866580247879028},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.6677606701850891},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6567109227180481},{"id":"https://openalex.org/keywords/concurrent-constraint-logic-programming","display_name":"Concurrent constraint logic programming","score":0.5903597474098206},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5644912123680115},{"id":"https://openalex.org/keywords/fifth-generation-programming-language","display_name":"Fifth-generation programming language","score":0.5172958374023438},{"id":"https://openalex.org/keywords/functional-logic-programming","display_name":"Functional logic programming","score":0.505467414855957},{"id":"https://openalex.org/keywords/doors","display_name":"Doors","score":0.49561774730682373},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.49211257696151733},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.482778936624527},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4651741683483124},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46406301856040955},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42582112550735474},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.417501300573349},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.3789464831352234},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3470866084098816},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.2689031958580017},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1259271502494812},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0834578275680542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0724615752696991},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.0689288079738617}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8779681921005249},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.6866580247879028},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.6677606701850891},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6567109227180481},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.5903597474098206},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5644912123680115},{"id":"https://openalex.org/C199305712","wikidata":"https://www.wikidata.org/wiki/Q3205914","display_name":"Fifth-generation programming language","level":3,"score":0.5172958374023438},{"id":"https://openalex.org/C96315309","wikidata":"https://www.wikidata.org/wiki/Q5508829","display_name":"Functional logic programming","level":4,"score":0.505467414855957},{"id":"https://openalex.org/C125209513","wikidata":"https://www.wikidata.org/wiki/Q4037520","display_name":"Doors","level":2,"score":0.49561774730682373},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.49211257696151733},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.482778936624527},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4651741683483124},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46406301856040955},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42582112550735474},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.417501300573349},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.3789464831352234},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3470866084098816},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.2689031958580017},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1259271502494812},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0834578275680542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0724615752696991},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0689288079738617},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1471068418000406","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068418000406","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/9CB30AB49665BCDFEBD79B0B0843A475/S1471068418000406a.pdf/div-class-title-past-and-present-and-future-of-parallel-and-distributed-computation-in-constraint-logic-programming-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s1471068418000406","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068418000406","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/9CB30AB49665BCDFEBD79B0B0843A475/S1471068418000406a.pdf/div-class-title-past-and-present-and-future-of-parallel-and-distributed-computation-in-constraint-logic-programming-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5899999737739563,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2891023565.pdf","grobid_xml":"https://content.openalex.org/works/W2891023565.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W187371254","https://openalex.org/W1985039455","https://openalex.org/W2781459982","https://openalex.org/W2796353354"],"related_works":["https://openalex.org/W1589232796","https://openalex.org/W316728381","https://openalex.org/W9461901","https://openalex.org/W4255951554","https://openalex.org/W2146478143","https://openalex.org/W2017122484","https://openalex.org/W2376476202","https://openalex.org/W1038119274","https://openalex.org/W1584569710","https://openalex.org/W1490546714"],"abstract_inverted_index":{"Declarative":[0],"languages":[1],"offer":[2],"unprecedented":[3],"opportunities":[4],"for":[5,42,47],"the":[6,21,32,40,59,62],"use":[7],"of":[8,34,50,61],"parallelism":[9,51],"to":[10,23],"speed":[11],"up":[12],"execution.":[13,44],"A":[14],"declarative":[15],"language,":[16],"being":[17],"not":[18],"procedural,":[19],"removes":[20],"need":[22],"perform":[24],"operations":[25],"in":[26,52],"a":[27],"strict":[28],"order":[29],"and":[30],"reduces":[31],"number":[33],"dependencies":[35],"among":[36],"operations,":[37],"thus":[38],"opening":[39],"doors":[41],"concurrent":[43],"The":[45],"potential":[46],"transparent":[48],"exploitation":[49],"logic":[53],"programming":[54],"emerged":[55],"almost":[56],"immediately":[57],"with":[58],"birth":[60],"paradigm":[63],"(Pollard":[64],"1981).":[65]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}