And-Or parallel Prolog: A recomputation based approach

• Type: Article in International Scientific Journal
• Date: 1993

Authors

Gupta, G (Author) Other; Hermenegildo, MV (Author) Other; Costa, VS (Author) FCUP

Journal

Title: New Generation Computing

Vol. 11

Pages: 297-321

ISSN: 0288-3635

Publisher: Springer Nature

Indexing

Scopus - 10 Citations

Other information

Authenticus ID: P-007-AZV

DOI: 10.1007/bf03037180

Abstract (EN): We argue 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 argue that these techniques have advantages over earlier proposals for exploiting and-or parallelism in Prolog. © 1993 Ohmsha, Ltd. and Springer.

Language: English

Type (Professor's evaluation): Scientific