ACE: And/or-parallel copying-based execution of logic programs

Gupta, Gopal; Hermenegildo, Manuel V.; Pontelli, Enrico y Santos Costa, Vítor (1994). ACE: And/or-parallel copying-based execution of logic programs. En: "The eleventh international conference of logic programming", June 1994, Italy.

Descripción

Título: ACE: And/or-parallel copying-based execution of logic programs
Autor/es:
  • Gupta, Gopal
  • Hermenegildo, Manuel V.
  • Pontelli, Enrico
  • Santos Costa, Vítor
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: The eleventh international conference of logic programming
Fechas del Evento: June 1994
Lugar del Evento: Italy
Título del Libro: Proceedings of the eleventh international conference of logic programming
Fecha: 1994
Materias:
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Inteligencia Artificial
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (1MB) | Vista Previa

Resumen

In this paper we present a novel execution model for parallel implementation of logic programs which is capable of exploiting both independent and-parallelism and or-parallelism in an efficient way. This model extends the stack copying approach, which has been successfully applied in the Muse system to implement or-parallelism, by integrating it with proven techniques used to support independent and-parallelism. We show how all solutions to non-deterministic andparallel goals are found without repetitions. This is done through recomputation as in Prolog (and in various and-parallel systems, like &-Prolog and DDAS), i.e., solutions of and-parallel goals are not shared. We propose a scheme for the efficient management of the address space in a way that is compatible with the apparently incompatible requirements of both and- and or-parallelism. We also show how the full Prolog language, with all its extra-logical features, can be supported in our and-or parallel system so that its sequential semantics is preserved. The resulting system retains the advantages of both purely or-parallel systems as well as purely and-parallel systems. The stack copying scheme together with our proposed memory management scheme can also be used to implement models that combine dependent and-parallelism and or-parallelism, such as Andorra and Prometheus.

Más información

ID de Registro: 14443
Identificador DC: http://oa.upm.es/14443/
Identificador OAI: oai:oa.upm.es:14443
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 12 Feb 2013 07:40
Ultima Modificación: 21 Abr 2016 14:06
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM