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

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

Description

Title: ACE: And/or-parallel copying-based execution of logic programs
Author/s:
  • Gupta, Gopal
  • Hermenegildo, Manuel V.
  • Pontelli, Enrico
  • Santos Costa, Vítor
Item Type: Presentation at Congress or Conference (Article)
Event Title: The eleventh international conference of logic programming
Event Dates: June 1994
Event Location: Italy
Title of Book: Proceedings of the eleventh international conference of logic programming
Date: 1994
Subjects:
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 (1MB) | Preview

Abstract

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.

More information

Item ID: 14443
DC Identifier: http://oa.upm.es/14443/
OAI Identifier: oai:oa.upm.es:14443
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 12 Feb 2013 07:40
Last Modified: 21 Apr 2016 14:06
  • 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