Completeness and Full Parallelism of Parallel Logic Programming Schemes

Laxmikant Vasudeo Kale

Symposium on Logic Programming 1987

Pulication Type: Paper

Download: pdf ps

Abstract

A clarification is given of the definitions of completeness and 'full parallelism' based on well-established notions, as they apply to parallel logic-programming schemes. For each property, the author gives some 'litmus-test' programs to test whether a given scheme has the property, presents some sufficient conditions which guarantee the lack of the property, and demonstrates that some schemes reported in literature do not possess these properties. Schemes that do possess the properties are also indicated.

Research Areas

Text Ref

L. V. Kale, "Completeness and Full Parallelism of Parallel Logic Programming 
Schemes", Proceedings of 1987 Symposium on Logic Programming, San Francisco, CA,
 1987, pp. 125-133.

BibTex

@INPROCEEDINGS{ParLogicPSLP87,
        author = "L. V. Kal{\'e}",
        title = "`{C}ompleteness' and `{F}ull Parallelism' of
Parallel Logic Programming Schemes",
        booktitle = "Proceedings of 1987 Symposium on Logic
Programming",
        year = "1987",
        address = "San Francisco, CA",
        pages = "125-133",
        annote = "87-1",
        group = Y,
}