Skip to main navigation Skip to search Skip to main content

Model for combined and-or parallel execution of logic programs

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

An extended AND-OR tree for efficiently supporting both AND-parallelism and OR-parallelism on shared-memory multiprocessors is presented. The approach is based on the binding-arrays method for OR-parallelism and the restricted AND-parallelism method for AND-parallelism. The combined AND-OR model avoids redundant computations when goals exhibit both AND- and OR-parallelism by representing the cross-product of the solutions from the AND-OR-parallel goals rather than recomputing it.

Original languageEnglish
Pages (from-to)260-263
Number of pages4
JournalProceedings of the International Conference on Parallel Processing
Volume2
StatePublished - 1989
EventProceedings of the 1989 International Conference on Parallel Processing - University Park, PA, USA
Duration: Aug 8 1989Aug 12 1989

Fingerprint

Dive into the research topics of 'Model for combined and-or parallel execution of logic programs'. Together they form a unique fingerprint.

Cite this