AND Parallelism in Logic Programs

Conery, John S.; Kibler, Dennis F.

AND Parallelism in Logic Programs

Download BibTeX Cite

Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Logic Programming. Pages 539-542.

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.

John S. Conery, and Dennis F. Kibler. 1983. AND Parallelism in Logic Programs. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83. IJCAI, 539–542. https://ijcai.org/proceedings/1983/129

@inproceedings{ijcai1983p129,
  title     = {AND Parallelism in Logic Programs},
  author    = {Conery, John S. and Kibler, Dennis F.},
  booktitle = {Proceedings of the Eighth International Joint Conference on
               Artificial Intelligence, {IJCAI-83}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Alan Bundy},
  pages     = {539--542},
  year      = {1983},
  note      = {Logic Programming},
  url       = {https://ijcai.org/proceedings/1983/129},
}

TY  - CPAPER
TI  - AND Parallelism in Logic Programs
AU  - Conery, John S.
AU  - Kibler, Dennis F.
T2  - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1983
SP  - 539
EP  - 542
UR  - https://ijcai.org/proceedings/1983/129
ER  -