{"type":"ScholarlyArticle","title":"AND Parallelism in Logic Programs","authors":[{"name":"John S. Conery","slug":"john-s-conery","given":"John S.","family":"Conery","affiliation":""},{"name":"Dennis F. Kibler","slug":"dennis-f-kibler","given":"Dennis F.","family":"Kibler","affiliation":""}],"abstract":"An interpreter for logic programs is defined which executes some goals in parallel. OR parallelism exploits the parallelism defined from nondeterministic choices, and is essentially a replacement for backtracking. AND parallel ism comes from solving goals in the body of a single clause in parallel, and is the only way to exploit parallelism in deterministic functions written as logic programs. A unique feature of our model is that it allows both forms of parallelism for the same computation.","doi":null,"url":"https://ijcai.org/proceedings/1983/129","pdf":"https://ijcai.org/proceedings/1983/0129.pdf","markdown":"https://ijcai.org/proceedings/1983/129.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/129","volume":{"slug":"1983","title":"Proceedings of the Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1983","url":"https://ijcai.org/proceedings/1983/","year":1983,"location":"Karlsruhe, West Germany","dates":"","editors":"Alan Bundy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Logic Programming","track":"Logic Programming","number":129,"pages":{"first":539,"last":542},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}