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.
| Original language | English (US) |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | IEEE |
| Pages | 125-133 |
| Number of pages | 9 |
| ISBN (Print) | 0818607998 |
| State | Published - 1987 |
ASJC Scopus subject areas
- Engineering(all)
Fingerprint Dive into the research topics of ''COMPLETENESS' AND 'FULL PARALLELISM' OF PARALLEL LOGIC PROGRAMMING SCHEMES.'. Together they form a unique fingerprint.
Cite this
Kale, L. V. (1987). 'COMPLETENESS' AND 'FULL PARALLELISM' OF PARALLEL LOGIC PROGRAMMING SCHEMES. In Unknown Host Publication Title (pp. 125-133). IEEE.