AND Parallelism in Logic Programs
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 parallelism 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.
Cite
Text
Conery and Kibler. "AND Parallelism in Logic Programs." International Joint Conference on Artificial Intelligence, 1983.Markdown
[Conery and Kibler. "AND Parallelism in Logic Programs." International Joint Conference on Artificial Intelligence, 1983.](https://mlanthology.org/ijcai/1983/conery1983ijcai-parallelism/)BibTeX
@inproceedings{conery1983ijcai-parallelism,
title = {{AND Parallelism in Logic Programs}},
author = {Conery, John S. and Kibler, Dennis F.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1983},
pages = {539-543},
url = {https://mlanthology.org/ijcai/1983/conery1983ijcai-parallelism/}
}