Loading...
Please wait, while we are loading the content...
Parallelism and Implementation Technology for Logic Programming Languages
| Content Provider | Semantic Scholar |
|---|---|
| Author | Costa, Vítor Santos |
| Copyright Year | 2007 |
| Abstract | Logic programming provides a high-level view of programming where programs are fundamentally seen as a collection of statements that define a model of the intended problem. Logic programming has been successfully applied to a vast number of applications, and has been shown to be a good match for parallel computers. This survey discusses the major issues on the implementation of logic programming systems. We first survey the evolution of sequential implementations, since the original Marseille Prolog implementation. Focus is then given to the WAM based techniques that are the basis for most Prolog systems. More recent developments are presented, such as compilation to native code. We next survey the main issues of parallel logic programming, since the original proposals for And/Or parallel systems. The article describes the major techniques used for the shared memory systems that implement only Or-parallelism and only And-parallelism, such as Aurora, Muse, &-Prolog, DDAS, &-ACE, PARLOG and KLIC. Last, the survey discusses recent work on combining several forms of parallelism, as in the Andorra based languages such as Andorra-I or Penny, or in the Independent-And plus Or models, such as the PBA, SBA, ACE, or Fire. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.ncc.up.pt/~vsc/papers/survey.pdf |
| Alternate Webpage(s) | http://www.dcc.fc.up.pt/~vsc/papers/survey.pdf |
| Alternate Webpage(s) | http://www.gbv.de/dms/bowker/toc/9780824722951.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
