Recomputation based implementation of and-or parallel prolog

Gupta, Gopal and Hermenegildo, Manuel V. ORCID: https://orcid.org/0000-0002-7583-323X (1992). Recomputation based implementation of and-or parallel prolog. En: "International Conference on Fifth Generation Computer Systems. 1992", 1992, June 1-5, Tokyo, Japan. ISBN 9051990995.

Descripción

Título: Recomputation based implementation of and-or parallel prolog
Autor/es:
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: International Conference on Fifth Generation Computer Systems. 1992
Fechas del Evento: 1992, June 1-5
Lugar del Evento: Tokyo, Japan
Título del Libro: Fifth Generation Computer Systems '92
Fecha: Junio 1992
ISBN: 9051990995
Materias:
ODS:
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Inteligencia Artificial
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

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

Resumen

We argüe that in order to exploit both Independent And- and Or-parallelism in Prolog programs there is advantage in recomputing some of the independent goals, as opposed to all their solutions being reused. We present an abstract model, called the Composition- Tree, for representing and-or parallelism in Prolog Programs. The Composition-tree closely mirrors sequential Prolog execution by recomputing some independent goals rather than fully re-using them. We also outline two environment representation techniques for And-Or parallel execution of full Prolog based on the Composition-tree model abstraction. We argüe that these techniques have advantages over earlier proposals for exploiting and-or parallelism in Prolog.

Más información

ID de Registro: 14475
Identificador DC: https://oa.upm.es/14475/
Identificador OAI: oai:oa.upm.es:14475
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 13 Feb 2013 07:32
Ultima Modificación: 27 Feb 2023 12:04