The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - July/August (1989 vol.6)
pp: 71-80
ABSTRACT
<p>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.</p>
INDEX TERMS
uncommitted choice languages; Aurora; KLIPS; parallel logic-programming architectures; OR-parallel Prolog system; AND-parallel flat-guarded-Horn-clause system; committed-choice languages; N-queens problem; Sequent Symmetry; Aurora; KLIPS; high level languages; logic programming; operations research; parallel programming; performance evaluation; PROLOG; storage management
CITATION
Evan Tick, "Comparing Two Parallel Logic-Programming Architectures", IEEE Software, vol.6, no. 4, pp. 71-80, July/August 1989, doi:10.1109/52.31654
33 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool