And-or parallel prolog: a recomputation based approach

Gupta, Gopal, Hermenegildo, Manuel V. ORCID: https://orcid.org/0000-0002-7583-323X and Santos Costa, Vítor (1993). And-or parallel prolog: a recomputation based approach. "New Generation Computing", v. 11 (n. 3/4); pp. 297-323. ISSN 0288-3635. https://doi.org/10.1007/BF03037180.

Descripción

Título: And-or parallel prolog: a recomputation based approach
Autor/es:
Tipo de Documento: Artículo
Título de Revista/Publicación: New Generation Computing
Fecha: 1993
ISSN: 0288-3635
Volumen: 11
Número: 3/4
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_A_1993-1.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: 14287
Identificador DC: https://oa.upm.es/14287/
Identificador OAI: oai:oa.upm.es:14287
URL Portal Científico: https://portalcientifico.upm.es/es/ipublic/item/5475868
Identificador DOI: 10.1007/BF03037180
URL Oficial: http://link.springer.com/article/10.1007%2FBF03037...
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 16 Ene 2013 07:54
Ultima Modificación: 12 Nov 2025 00:00