{"id":"https://openalex.org/W2106730449","doi":"https://doi.org/10.7907/2ngs-bp80","title":"A Parallel Execution Model for Logic Programming","display_name":"A Parallel Execution Model for Logic Programming","publication_year":1986,"publication_date":"1986-01-01","ids":{"openalex":"https://openalex.org/W2106730449","doi":"https://doi.org/10.7907/2ngs-bp80","mag":"2106730449"},"language":"en","primary_location":{"id":"pmh:oai:authors.library.caltech.edu:26663","is_oa":true,"landing_page_url":"https://authors.library.caltech.edu/26663/1/postscript.ps","pdf_url":"https://resolver.caltech.edu/CaltechCSTR:1986.5227-tr-86","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Report or Paper"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://resolver.caltech.edu/CaltechCSTR:1986.5227-tr-86","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089027506","display_name":"Peyyun P Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Li, Peyyun Peggy","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089027506"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.28137844,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9976000189781189,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9976000189781189,"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.9962000250816345,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/sync","display_name":"sync","score":0.7807808518409729},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.749576210975647},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.6841972470283508},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.592348575592041},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5184357166290283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44804489612579346},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.436431348323822},{"id":"https://openalex.org/keywords/data-flow-analysis","display_name":"Data-flow analysis","score":0.41521814465522766},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3799075484275818},{"id":"https://openalex.org/keywords/data-flow-diagram","display_name":"Data flow diagram","score":0.33029311895370483},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23753154277801514},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.1776995062828064},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1604350209236145}],"concepts":[{"id":"https://openalex.org/C3913047","wikidata":"https://www.wikidata.org/wiki/Q1956265","display_name":"sync","level":3,"score":0.7807808518409729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.749576210975647},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.6841972470283508},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.592348575592041},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5184357166290283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44804489612579346},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.436431348323822},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.41521814465522766},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3799075484275818},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.33029311895370483},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23753154277801514},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.1776995062828064},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1604350209236145},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"pmh:oai:authors.library.caltech.edu:26663","is_oa":true,"landing_page_url":"https://authors.library.caltech.edu/26663/1/postscript.ps","pdf_url":"https://resolver.caltech.edu/CaltechCSTR:1986.5227-tr-86","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Report or Paper"},{"id":"pmh:oai:thesis.library.caltech.edu:1023","is_oa":true,"landing_page_url":null,"pdf_url":"https://thesis.library.caltech.edu/1023/1/Li_pp_1986.pdf","source":{"id":"https://openalex.org/S4306402402","display_name":"CaltechTHESIS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"pmh:oai:cds.cern.ch:176879","is_oa":false,"landing_page_url":"http://cds.cern.ch/record/176879","pdf_url":null,"source":{"id":"https://openalex.org/S2765065519","display_name":"CERN Bulletin","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4327876864","host_organization_name":"CERN Publications","host_organization_lineage":["https://openalex.org/P4327876864"],"host_organization_lineage_names":["CERN Publications"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"mag:2106730449","is_oa":false,"landing_page_url":"https://resolver.caltech.edu/CaltechCSTR:1986.5227-tr-86","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null},{"id":"doi:10.7907/2ngs-bp80","is_oa":true,"landing_page_url":"https://doi.org/10.7907/2ngs-bp80","pdf_url":null,"source":{"id":"https://openalex.org/S7407050848","display_name":"Caltech Library","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"thesis"},{"id":"doi:10.7907/ekp3r-95f10","is_oa":true,"landing_page_url":"https://doi.org/10.7907/ekp3r-95f10","pdf_url":null,"source":{"id":"https://openalex.org/S7407050848","display_name":"Caltech Library","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:authors.library.caltech.edu:26663","is_oa":true,"landing_page_url":"https://authors.library.caltech.edu/26663/1/postscript.ps","pdf_url":"https://resolver.caltech.edu/CaltechCSTR:1986.5227-tr-86","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Report or Paper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2106730449.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2266561084","https://openalex.org/W2048178547","https://openalex.org/W2138033751","https://openalex.org/W1710695987","https://openalex.org/W2260662308","https://openalex.org/W2501864904","https://openalex.org/W2020234097","https://openalex.org/W2075092045","https://openalex.org/W1562251494","https://openalex.org/W2127548842","https://openalex.org/W3145933944","https://openalex.org/W1562790053","https://openalex.org/W2171329192","https://openalex.org/W92070905","https://openalex.org/W82022919","https://openalex.org/W55934040","https://openalex.org/W2253525147","https://openalex.org/W2011762053","https://openalex.org/W204241074","https://openalex.org/W1967359636"],"abstract_inverted_index":{"The":[0,12,80,106,134,208,224],"Sync":[1,13,81,112,232,248],"Model,":[2],"a":[3,16,26,30,40,77,217,236,243],"parallel":[4],"execution":[5],"method":[6,174],"for":[7,169,230],"logic":[8,27],"programming,":[9],"is":[10,15,36,58,83,131,136,175,205,212,226,240],"proposed.":[11],"Model":[14,82,113,249],"multiple-solution":[17],"data-driven":[18],"model":[19],"that":[20],"realizes":[21],"AND-parallelism":[22],"and":[23,71,88,97,108,161,259],"OR-parallelism":[24],"in":[25,48,234],"program":[28],"assuming":[29],"message-passing":[31],"multiprocessor":[32],"system.":[33],"AND":[34],"parallelism":[35,57],"implemented":[37],"by":[38,60,116],"constructing":[39],"dynamic":[41,237],"data":[42],"flow":[43],"graph":[44],"of":[45,68,110,119,126,155,182,185,201,213],"the":[46,49,66,73,103,111,117,120,129,156,179,186,189,202,221,231,247,254],"literals":[47],"clause":[50],"body":[51],"with":[52,76,256],"an":[53,137,145,227],"ordering":[54],"algorithm.":[55,79,122],"OR":[56],"achieved":[59],"adding":[61],"special":[62],"Synchronization":[63],"signals":[64],"to":[65,85,165,177,220],"stream":[67],"partial":[69],"solutions":[70,96],"synchronizing":[72],"multiple":[74],"streams":[75],"merge":[78,121],"proved":[84],"be":[86,166,251],"sound":[87],"complete.":[89],"Soundness":[90],"means":[91,99],"it":[92,100],"only":[93],"generates":[94,101],"correct":[95,104],"completeness":[98,109],"all":[102],"solutions.":[105],"soundness":[107],"are":[114,159],"implied":[115],"correctness":[118],"A":[123,172,192],"new":[124],"class":[125],"interconnection":[127],"networks,":[128],"Sneptree,":[130,157,187],"also":[132,206],"presented.":[133,207],"Sneptree":[135,204,225,255],"augmented":[138],"complete":[139,147],"binary":[140,148],"tree":[141,149,239],"which":[142,211,235],"can":[143,250],"simulate":[144],"unbounded":[146],"optimally.":[150],"Amongst":[151],"different":[152],"connection":[153],"patterns":[154],"some":[158],"regular":[160],"extensible":[162],"so":[163],"as":[164],"well":[167],"suited":[168],"VLSI":[170],"implementation.":[171],"recursive":[173],"presented":[176],"generate":[178],"H-structure":[180],"layout":[181],"one":[183],"type":[184],"called":[188],"Cyclic":[190,203],"Sneptree.":[191],"message":[193],"routing":[194,209],"algorithm":[195],"between":[196],"any":[197],"two":[198],"leaf":[199],"nodes":[200],"algorithm,":[210,246],"O(n)":[214],"complexity,":[215],"gives":[216],"good":[218],"approximation":[219],"shortest":[222],"path.":[223],"ideal":[228],"architecture":[229],"model,":[233],"process":[238],"constructed.":[241],"With":[242],"simple":[244],"mapping":[245],"mapped":[252],"onto":[253],"highly-balanced":[257],"load":[258],"low":[260],"overhead.":[261]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}