PARLOG: Parallel programming in logic. PARLOG is a logic programming language in the sense that nearly every definition and query can be read as a sentence of predicate logic. It differs from PROLOG in incorporating parallel modes of evaluation. For reasons of efficient implementation, it distinguishes and separates and- parallel and or-parallel evaluation. PARLOG relations are divided into two types: single-soluton relations and all-solutions relations. A conjunction of single-solution relation calls can be evaluated in parallel with shared variables acting as communication channels for the passing of partial bindings. Only one solution to each call is computed, using committed choice nondeterminism. A conjunction of all-solutions relation calls is evaluated without communication of partial bindings, but all the solutions may be found by an or-parallel exploration of the different evaluation paths. A set constructor provides the main interface between single-solution relations and all-solutions relations. This paper is a tutorial introduction to PARLOG. It assumes familiarity with logic programming.

References in zbMATH (referenced in 39 articles , 1 standard article )

Showing results 1 to 20 of 39.
Sorted by year (citations)

1 2 next

  1. Ariola, Z. M.; Massey, B. C.; Sami, M.; Tick, E.: A common intermediate language and its use in partitioning concurrent declarative programs. (1996) ioport
  2. Rokusawa, Katsuaki; Nakase, Akihiko; Chikayama, Takashi: Distributed memory implementation of KLIC. (1996) ioport
  3. Börger, Egon; Riccobene, Elvinia: A formal specification of PARLOG (1993)
  4. Corradini, Andrea; Montanari, Ugo: An algebraic semantics for structured transition systems and its application to logic programs (1992)
  5. Deransart, Pierre; Ferrand, Gérard: An operational formal definition of PROLOG: A specification method and its application (1992)
  6. Gabbrielli, Maurizio; Levi, Giorgio: Unfolding and fixpoint semantics of concurrent constraint logic programs (1992)
  7. Wen, Dongchan; Li, Wenfeng; Fang, Jiaguo: Design of PARLOG sequential compiling system (1992)
  8. de Boer, F. S.; Rutten, J. J. M. M.; Kok, J. N.; Palamidessi, C.: Semantic models for concurrent logic languages (1991)
  9. Giovannetti, Elio; Levi, Giorgio; Moiso, Corrado; Palamidessi, Catuscia: Kernel-LEAF: A logic plus functional language (1991)
  10. Ramakrishnan, Raghu: Parallelism in logic programs (1991)
  11. Schend, B.: A methodology for detecting shared variable dependencies in logic programs (1991)
  12. Falaschi, Moreno; Levi, Giorgio: Finite failures and partial computations in concurrent logic languages (1990)
  13. Jouvelot, P.; Feautrier, P.: Parallélisation sémantique (1990)
  14. Murakami, Masaki: A declarative semantics of flat guarded Horn clauses for programs with perpetual processes (1990)
  15. Bansal, Arvind; Sterling, Leon S.: Transforming generate-and-test programs to execute under committed-choice AND-parallelism (1989)
  16. Gregory, Steve; Foster, Ian T.; Burt, Alastair D.; Ringwood, Graem A.: An abstract machine for the implementation of PARLOG on uniprocessors (1989)
  17. Ramanujam, R.: Semantics of distributed definite clause programs (1989)
  18. Bellia, M.: Logic and functional programming by retractions (1988)
  19. Clark, Keith L.: PARLOG and its applications (1988)
  20. Furukawa, Koichi; Okumura, Akira; Murakami, Masaki: Unfolding rules for GHC programs (1988)

1 2 next