A parallel logic programming approach to job shop scheduling constraint satisfaction problems
Publication date:
Citación:
Descripción física:
Abstract:
In this paper we put together a Parallel Logic Programming schema and a heuristic search strategy in order to solve constraint satisfaction problems. The idea is to introduce heuristic information in the construction of logic programs in order to improve the performance. The experimental results show that logic programs can be designed that exhibit parallelism, and that the use of heuristic information translates into speedup in obtaining answers
In this paper we put together a Parallel Logic Programming schema and a heuristic search strategy in order to solve constraint satisfaction problems. The idea is to introduce heuristic information in the construction of logic programs in order to improve the performance. The experimental results show that logic programs can be designed that exhibit parallelism, and that the use of heuristic information translates into speedup in obtaining answers
Description:
Congreso APPIA-GULP-PRODE'98 Joint Conference on Declarative Programming ( La Coruña. 1998)
Collections
- Informática [778]
- Ponencias, Discursos y Conferencias [4026]