Live Webcast 15th Annual Charm++ Workshop

-->

PPL/Charm++ at SC17

Completeness and Full Parallelism of Parallel Logic Programming Schemes
Symposium on Logic Programming 1987
Publication Type: Paper
Repository URL:
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.
TextRef
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.
People
Research Areas