English español

Repositorio de la Universidad de Oviedo. > Producción Bibliográfica de UniOvi: RECOPILA > Ponencias, Discursos y Conferencias >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10651/31964

Title: A parallel logic programming approach to job shop scheduling constraint satisfaction problems
Author(s): Puente Peinador, Jorge
Varela Arias, José Ramiro
Rodríguez Vela, María del Camino
Alonso González, César Luis
Issue date: 1998
Citation: AGP, 98, p. 29-41 (1998)
Format extent: p. 29-41
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
Description: Congreso APPIA-GULP-PRODE'98 Joint Conference on Declarative Programming ( La Coruña. 1998)
URI: http://hdl.handle.net/10651/31964
Appears in Collections:Ponencias, Discursos y Conferencias

Files in This Item:

File Description SizeFormat
f03.pdfVersión de los autores240,61 kBAdobe PDFView/Open

Exportar a Mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Base de Datos de Autoridades Biblioteca Universitaria Consultas / Sugerencias