On the correctness and efficiency of independent and-parallelism in logic programs

Hermenegildo, Manuel V. and Rossi, Francesca (1989). On the correctness and efficiency of independent and-parallelism in logic programs. In: "1989 north american conference in logic programming", October 16-20, 1989, Cleveland, Ohio. ISBN 0262620642.

Description

Title: On the correctness and efficiency of independent and-parallelism in logic programs
Author/s:
  • Hermenegildo, Manuel V.
  • Rossi, Francesca
Item Type: Presentation at Congress or Conference (Article)
Event Title: 1989 north american conference in logic programming
Event Dates: October 16-20, 1989
Event Location: Cleveland, Ohio
Title of Book: Logic Programming, Proceedings of the North American Conference 1989
Date: October 1989
ISBN: 0262620642
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

This paper presents and proves some fundamental results for independent and-parallelism (IAP). First, the paper treats the issues of correctness and efficiency: after defining strict and non-strict goal independence, it is proved that if strictly independent goals are executed in parallel the solutions obtained are the same as those produced by standard sequential execution. It is also shown that, in the absence of failure, the parallel proof procedure doesn't genérate any additional work (with respect to standard SLDresolution) while the actual execution time is reduced. The same results hold even if non-strictly independent goals are executed in parallel, provided a trivial rewriting of such goals is performed. In addition, and most importantly, treats the issue of compile-time generation of IAP by proposing conditions, to be written at compile-time, to efficiently check strict and non-strict goal independence at run-time and proving the sufficiency of such conditions. It is also shown how simpler conditions can be constructed if some information regarding the binding context of the goals to be executed in parallel is available to the compiler trough either local or program-level analysis. These results therefore provide a formal basis for the automatic compile-time generation of IAP. As a corollary of such results, the paper also proves that negative goals are always non-strictly independent, and that goals which share a first occurrence of an existential variable are never independent.

More information

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