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. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
