Introduction: Logic Programming and Parallel Processing

  • Gopal Gupta


The technology of sequential computers has been pushed nearly to its limits, and there is a growing realization that parallel computers are the way to high-performance computing. There are three approaches for running programs in parallel: the first is to use existing sequential (imperative) languages extended with constructs for parallelism. This approach (e.g. Ada [B82], Occam [I84]) makes the task of software writing very difficult, since the programmer must explicitly manage the parallel processes. The second approach is to use compilers that automatically paralleliz sequential programs [AK87]. Automatic parallelization of sequential programs is a very hard task, and, in general, it cannot exploit all the available parallelism in a program. The third approach, which we believe to be the most promising, is to use declarative languages: programs written in these languages can be implicitly parallilized—much more easily than those written in imperative languages—since declara­tive languages disallow explicit control structures and side-effects.


Logic Program Logic Programming Parallel Execution Horn Clause Abstract Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1994

Authors and Affiliations

  • Gopal Gupta
    • 1
  1. 1.Laboratory for Logic, Databases, and Advanced Programming Department of Computer ScienceNew Mexico State UniversityLas CrucesUSA

Personalised recommendations