{"id":"https://openalex.org/W2127409356","doi":"https://doi.org/10.1017/s1471068404002030","title":"On applying or-parallelism and tabling to logic programs","display_name":"On applying or-parallelism and tabling to logic programs","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2127409356","doi":"https://doi.org/10.1017/s1471068404002030","mag":"2127409356"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068404002030","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068404002030","pdf_url":null,"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":"green","oa_url":"http://hdl.handle.net/10216/9779","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007895512","display_name":"Ricardo Rocha","orcid":"https://orcid.org/0000-0003-4502-8835"},"institutions":[{"id":"https://openalex.org/I182534213","display_name":"Universidade do Porto","ror":"https://ror.org/043pwc612","country_code":"PT","type":"education","lineage":["https://openalex.org/I182534213"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"RICARDO ROCHA","raw_affiliation_strings":["DCC-FC & LIACC, Universidade do Porto, Portugal (e-mail:","DCC-FC & LIACC, Universidade do Porto, Portugal (e-mail: ricroc@ncc.up.pt, fds@ncc.up.pt)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DCC-FC & LIACC, Universidade do Porto, Portugal (e-mail:","institution_ids":["https://openalex.org/I182534213"]},{"raw_affiliation_string":"DCC-FC & LIACC, Universidade do Porto, Portugal (e-mail: ricroc@ncc.up.pt, fds@ncc.up.pt)#TAB#","institution_ids":["https://openalex.org/I182534213"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100363368","display_name":"Fernando Silva","orcid":"https://orcid.org/0000-0001-8411-7094"},"institutions":[{"id":"https://openalex.org/I182534213","display_name":"Universidade do Porto","ror":"https://ror.org/043pwc612","country_code":"PT","type":"education","lineage":["https://openalex.org/I182534213"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"FERNANDO SILVA","raw_affiliation_strings":["DCC-FC & LIACC, Universidade do Porto, Portugal (e-mail:","DCC-FC & LIACC, Universidade do Porto, Portugal (e-mail: ricroc@ncc.up.pt, fds@ncc.up.pt)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DCC-FC & LIACC, Universidade do Porto, Portugal (e-mail:","institution_ids":["https://openalex.org/I182534213"]},{"raw_affiliation_string":"DCC-FC & LIACC, Universidade do Porto, Portugal (e-mail: ricroc@ncc.up.pt, fds@ncc.up.pt)#TAB#","institution_ids":["https://openalex.org/I182534213"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059093687","display_name":"V\u0131\u0301tor Santos Costa","orcid":"https://orcid.org/0000-0002-3344-8237"},"institutions":[{"id":"https://openalex.org/I122140584","display_name":"Universidade Federal do Rio de Janeiro","ror":"https://ror.org/03490as77","country_code":"BR","type":"education","lineage":["https://openalex.org/I122140584"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"V\u00cdTOR SANTOS COSTA","raw_affiliation_strings":["COPPE Systems & LIACC, Universidade do Rio de Janeiro, Brasil (e-mail:","COPPE Systems & LIACC, Universidade do Rio de Janeiro, Brasil (e-mail: vitor@cos.ufrj.br)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"COPPE Systems & LIACC, Universidade do Rio de Janeiro, Brasil (e-mail:","institution_ids":["https://openalex.org/I122140584"]},{"raw_affiliation_string":"COPPE Systems & LIACC, Universidade do Rio de Janeiro, Brasil (e-mail: vitor@cos.ufrj.br)","institution_ids":["https://openalex.org/I122140584"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.2867,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.9697798,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"5","issue":"1-2","first_page":"161","last_page":"205"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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.9998000264167786,"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/T10126","display_name":"Logic, programming, and type systems","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/T10142","display_name":"Formal Methods in Verification","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8805462121963501},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.8415108323097229},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.708686888217926},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.6759910583496094},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4511118531227112},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.4469109773635864},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.4435879588127136},{"id":"https://openalex.org/keywords/fifth-generation-programming-language","display_name":"Fifth-generation programming language","score":0.44044554233551025},{"id":"https://openalex.org/keywords/declarative-programming","display_name":"Declarative programming","score":0.42649397253990173},{"id":"https://openalex.org/keywords/execution-model","display_name":"Execution model","score":0.42340725660324097},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.3622526526451111}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8805462121963501},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.8415108323097229},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.708686888217926},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.6759910583496094},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4511118531227112},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.4469109773635864},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.4435879588127136},{"id":"https://openalex.org/C199305712","wikidata":"https://www.wikidata.org/wiki/Q3205914","display_name":"Fifth-generation programming language","level":3,"score":0.44044554233551025},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.42649397253990173},{"id":"https://openalex.org/C2776834041","wikidata":"https://www.wikidata.org/wiki/Q25346349","display_name":"Execution model","level":2,"score":0.42340725660324097},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.3622526526451111}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068404002030","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068404002030","pdf_url":null,"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"},{"id":"pmh:oai:repositorio-aberto.up.pt:10216/9779","is_oa":true,"landing_page_url":"http://hdl.handle.net/10216/9779","pdf_url":null,"source":{"id":"https://openalex.org/S4306401934","display_name":"Open Repository of the University of Porto (University of Porto)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I182534213","host_organization_name":"Universidade do Porto","host_organization_lineage":["https://openalex.org/I182534213"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Tese"}],"best_oa_location":{"id":"pmh:oai:repositorio-aberto.up.pt:10216/9779","is_oa":true,"landing_page_url":"http://hdl.handle.net/10216/9779","pdf_url":null,"source":{"id":"https://openalex.org/S4306401934","display_name":"Open Repository of the University of Porto (University of Porto)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I182534213","host_organization_name":"Universidade do Porto","host_organization_lineage":["https://openalex.org/I182534213"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Tese"},"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":93,"referenced_works":["https://openalex.org/W1284694","https://openalex.org/W6279871","https://openalex.org/W12344845","https://openalex.org/W35848413","https://openalex.org/W52410494","https://openalex.org/W57903016","https://openalex.org/W58948792","https://openalex.org/W73353222","https://openalex.org/W80818145","https://openalex.org/W88180567","https://openalex.org/W89291972","https://openalex.org/W141981140","https://openalex.org/W177987780","https://openalex.org/W190164090","https://openalex.org/W192608742","https://openalex.org/W195643613","https://openalex.org/W1482220788","https://openalex.org/W1492803714","https://openalex.org/W1498484072","https://openalex.org/W1503973138","https://openalex.org/W1505752097","https://openalex.org/W1514746077","https://openalex.org/W1518621415","https://openalex.org/W1522225310","https://openalex.org/W1541434994","https://openalex.org/W1545164866","https://openalex.org/W1548987332","https://openalex.org/W1559402073","https://openalex.org/W1570280013","https://openalex.org/W1571035569","https://openalex.org/W1580727523","https://openalex.org/W1586107449","https://openalex.org/W1586338668","https://openalex.org/W1586430014","https://openalex.org/W1588020990","https://openalex.org/W1589263172","https://openalex.org/W1591051730","https://openalex.org/W1595761884","https://openalex.org/W1608806855","https://openalex.org/W1682138878","https://openalex.org/W1732271046","https://openalex.org/W1746694335","https://openalex.org/W1763146822","https://openalex.org/W1766332311","https://openalex.org/W1766658279","https://openalex.org/W1774324140","https://openalex.org/W1827267273","https://openalex.org/W1848385158","https://openalex.org/W1965784613","https://openalex.org/W1968513265","https://openalex.org/W1970416898","https://openalex.org/W1974057462","https://openalex.org/W1978108034","https://openalex.org/W1985039455","https://openalex.org/W1989282019","https://openalex.org/W1991003782","https://openalex.org/W1997210046","https://openalex.org/W2015640848","https://openalex.org/W2016462478","https://openalex.org/W2023578426","https://openalex.org/W2026433347","https://openalex.org/W2032545435","https://openalex.org/W2037412343","https://openalex.org/W2040272201","https://openalex.org/W2047008023","https://openalex.org/W2055006439","https://openalex.org/W2064601740","https://openalex.org/W2064617564","https://openalex.org/W2070598037","https://openalex.org/W2071433880","https://openalex.org/W2075610180","https://openalex.org/W2080716125","https://openalex.org/W2081317651","https://openalex.org/W2085609918","https://openalex.org/W2089499361","https://openalex.org/W2091478774","https://openalex.org/W2096883220","https://openalex.org/W2096979400","https://openalex.org/W2097366413","https://openalex.org/W2100264125","https://openalex.org/W2100738443","https://openalex.org/W2111277910","https://openalex.org/W2118382442","https://openalex.org/W2121227140","https://openalex.org/W2127852846","https://openalex.org/W2134169262","https://openalex.org/W2143382644","https://openalex.org/W2155945137","https://openalex.org/W2173733616","https://openalex.org/W2212036697","https://openalex.org/W2400182190","https://openalex.org/W2495949634","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1977834309","https://openalex.org/W4380901377","https://openalex.org/W2415737251","https://openalex.org/W1598781941","https://openalex.org/W4205997139","https://openalex.org/W1973582361","https://openalex.org/W1568189742","https://openalex.org/W1504061838","https://openalex.org/W4250566046","https://openalex.org/W1485481979"],"abstract_inverted_index":{"Logic":[0,13,267],"programming":[1,85,180],"languages,":[2],"such":[3],"as":[4],"Prolog,":[5],"provide":[6],"a":[7,28,106,127,154,174],"high-level,":[8],"declarative":[9],"approach":[10],"to":[11,25,48,61,104,109,114,158,214,230,259],"programming.":[12],"Programming":[14,268],"offers":[15],"great":[16],"potential":[17,81],"for":[18,38,130,178,198,205,266],"implicit":[19,124],"parallelism,":[20],"thus":[21],"allowing":[22],"parallel":[23,56,156,175,245],"systems":[24,238],"often":[26,78],"reduce":[27],"program's":[29],"execution":[30,57,191],"time":[31],"without":[32],"programmer":[33],"intervention.":[34],"We":[35],"believe":[36],"that":[37,41,70,123,210,235,253],"complex":[39],"applications":[40,265],"take":[42],"several":[43],"hours,":[44],"if":[45],"not":[46],"days,":[47],"return":[49],"an":[50,144],"answer,":[51],"even":[52],"limited":[53],"speedups":[54],"from":[55],"can":[58,223,239,269],"directly":[59],"translate":[60],"very":[62],"significant":[63],"productivity":[64],"gains.":[65],"It":[66],"has":[67,102],"been":[68],"argued":[69],"Prolog's":[71,97],"evaluation":[72],"strategy":[73],"\u2013":[74,77,148,150],"SLD":[75,221],"resolution":[76,222],"limits":[79],"the":[80,83,163,170,196,202,211,218,236,262],"of":[82,165,173,220,264],"logic":[84,131,179,260],"paradigm.":[86],"The":[87],"past":[88],"years":[89],"have":[90,140],"therefore":[91],"seen":[92],"widening":[93],"efforts":[94],"at":[95],"increasing":[96],"declarativeness":[98],"and":[99,117,142,151,200,227,234,257],"expressiveness.":[100],"Tabling":[101],"proved":[103],"be":[105,225,270],"viable":[107],"technique":[108],"efficiently":[110],"overcome":[111],"SLD's":[112],"susceptibility":[113],"infinite":[115],"loops":[116],"redundant":[118],"subcomputations.":[119],"Our":[120],"research":[121],"demonstrates":[122],"or-parallelism":[125,256],"is":[126,169,193],"natural":[128],"fit":[129],"programs":[132,261],"with":[133],"tabling.":[134],"To":[135,162],"substantiate":[136],"this":[137],"belief,":[138],"we":[139,152],"designed":[141],"implemented":[143],"or-parallel":[145],"tabling":[146,176,258],"engine":[147,177],"OPTYap":[149,168,182],"used":[153],"shared-memory":[155,244],"machine":[157],"evaluate":[159],"its":[160],"performance.":[161],"best":[164],"our":[166,251],"knowledge,":[167],"first":[171],"implementation":[172],"systems.":[181],"builds":[183],"on":[184,195,201,243],"Yap's":[185],"efficient":[186],"sequential":[187],"Prolog":[188],"engine.":[189],"Its":[190],"model":[192],"based":[194],"SLG-WAM":[197],"tabling,":[199],"environment":[203],"copying":[204],"or-parallelism.":[206],"Preliminary":[207],"results":[208],"indicate":[209],"mechanisms":[212],"proposed":[213],"parallelize":[215,231],"search":[216],"in":[217],"context":[219],"indeed":[224],"effectively":[226],"naturally":[228],"generalized":[229],"tabled":[232],"computations,":[233],"resulting":[237],"achieve":[240],"good":[241],"performance":[242],"machines.":[246],"More":[247],"importantly,":[248],"it":[249],"emphasizes":[250],"belief":[252],"through":[254],"applying":[255],"range":[263],"increased.":[271]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}