Comparing two parallel logic-programming architectures

Abstract

The performances of two parallel logic-programming architectures, an OR-parallel Prolog system and an AND-parallel flat-guarded-Horn-clause system (FGHC), are compared. A description is given of how fast algorithms are developed on both OR-parallel and AND-parallel programming paradigms, as well as in both uncommitted-choice and committed-choice languages. To compare the systems, seven algorithms for solving the N-queens problem were executed, and their performances were measured on a Sequent Symmetry under the Aurora and KLIPS architectures.