Andorra-I preprocessor: Supporting full Prolog on the basic Andorra model

• Type: Article in International Conference Proceedings Book
• Date: 1991

Authors

Vitor Santos Costa (Author) FCUP; Warren David, HD (Author) Other; Rong Yang (Author) Other

Conference proceedings International

Title: Logic Programming, Proceedings of the Eigth International Conference, Paris, France, June 24-28, 1991

Pages: 443-456

Logic Programming - Proceedings of the 8th International Conference

Paris, Fr, 24 June 1991 through 28 June 1991

Indexing

Scopus - 26 Citations

Other information

Authenticus ID: P-007-5EF

Abstract (EN): Andorra-I is an experimental parallel Prolog system that transparently exploits both dependent and-parallelism and or-parallelism. It constitutes the first implementation of the Basic Andorra model, a parallel execution model for logic programs in which determinate goals are executed before other goals. This model, besides combining two of the most important forms of implicit parallelism in logic programs, also provides a form of implicit coroutining. This means that Andorra-I not only supports standard Prolog but also provides the capabilities of flat committed-choice languages. In this paper, we discuss the preprocessor which enables Andorra-I to support full Prolog, including cut, commit, meta-predicates and side-effect predicates. The main functions of the preprocessor are to perform a mode analysis of the program by abstract interpretation, to use this information to recognize procedures containing pruning operators that are potentially ``noisy'', to protect calls to such ``sensitive'' predicates by restricting certain conjunctions to be executed sequentially, and finally to generate for each predicate a routine which will determine when calls to that predicate become executable through becoming clause determinate.

Language: English

Type (Professor's evaluation): Scientific