---
title: "AND Parallelism in Logic Programs"
authors:
  - "John S. Conery"
  - "Dennis F. Kibler"
doi: ""
url: "https://ijcai.org/proceedings/1983/129"
pdf: "https://ijcai.org/proceedings/1983/0129.pdf"
venue: "Proceedings of the Eighth International Joint Conference on Artificial Intelligence"
year: 1983
pages: "539-542"
track: "Logic Programming"
keywords:
---

# AND Parallelism in Logic Programs

John S. Conery, Dennis F. Kibler

*Proceedings of the Eighth International Joint Conference on Artificial Intelligence*, 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.