Bibliographic Details
| Title: |
Parallel Logic Programming for Problem Solving. |
| Authors: |
Arias, Ramiro Varela1 ramiro@aic.uniovi.es, Vela, Camino Rodríguez1 camino@aic.uniovi.es, Peinador, Jorge Puente1 puente@aic.uniovi.es, González, Cesar Alonso1 calonso@aic.uniovi.es |
| Source: |
International Journal of Parallel Programming. Jun2000, Vol. 28 Issue 3, p275-319. 45p. |
| Subjects: |
Parallel logic programming, Logic programming, Parallel programming, Computer programming, Heuristic programming, Problem solving, Computer science |
| Abstract: |
We present a new model for parallel evaluation of logic programs. This model can exploit the main sources of parallelism that the language of logic expresses: Independent parallelism and parallelism, together with a secondary source emerging as a consequence of the Independent Parallelism: the producer/consumer parallelism. The efficiency is derived from the use of ordered structures for managing the information generated throughout the search process. The model is suitable for evaluating programs with a high degree of non-determinism because it never generates two processes for solving the same subgoal and hence it can exploit the same real parallelism generating a lower number of processes than other models. As an application example, we consider the Job Shop Scheduling problem. We report experimental results showing that logic programs can be designed that exhibit parallelism, and that the use of heuristic information translates into speedup in obtaining answers. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Parallel Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |