Automatic exploitation of non-determinate independent and-parallelism in the basic andorra model

Olmedilla Arregui, Juan José and Bueno Carrillo, Francisco and Hermenegildo, Manuel V. (1994). Automatic exploitation of non-determinate independent and-parallelism in the basic andorra model. In: "LOPSTR 93, International Workshop on Logic Program Synthesis and Transformation", 7–9 July 1993, Louvain-la-Neuve, Belgium. ISBN 9781447132349.

Description

Title: Automatic exploitation of non-determinate independent and-parallelism in the basic andorra model
Author/s:
  • Olmedilla Arregui, Juan José
  • Bueno Carrillo, Francisco
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: LOPSTR 93, International Workshop on Logic Program Synthesis and Transformation
Event Dates: 7–9 July 1993
Event Location: Louvain-la-Neuve, Belgium
Title of Book: Logic-Based Program Synthesis and Transformation
Date: 1994
ISBN: 9781447132349
Subjects:
Freetext Keywords: language constructs, programming environments, formal program development methodologies, implementation issues, evaluation, simulation and benchmarking, construcciones lingüísticas, entornos de programación, metodologías formales de desarrollo de programas, cuestiones de aplicación, evaluación, simulación y evaluación comparativa.
Faculty: Facultad de Informática (UPM)
Department: Inteligencia Artificial
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (754kB) | Preview

Abstract

Andorra-I is the first implementation of a language based on the Andorra Principie, which states that determinate goals can (and shonld) be run before other goals, and even in a parallel fashion. This principie has materialized in a framework called the Basic Andorra model, which allows or-parallelism as well as (dependent) and-parallelism for determinate goals. In this report we show that it is possible to further extend this model in order to allow general independent and-parallelism for nondeterminate goals, withont greatly modifying the underlying implementation machinery. A simple an easy way to realize such an extensión is to make each (nondeterminate) independent goal determinate, by using a special "bagof" constract. We also show that this can be achieved antomatically by compile-time translation from original Prolog programs. A transformation that fulfüls this objective and which can be easily antomated is presented in this report.

More information

Item ID: 14470
DC Identifier: http://oa.upm.es/14470/
OAI Identifier: oai:oa.upm.es:14470
Official URL: http://link.springer.com/chapter/10.1007%2F978-1-4471-3234-9_16
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 13 Feb 2013 07:30
Last Modified: 21 Apr 2016 14:10
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM