Parlog

Parlog is a logic programming language designed for efficient utilization of parallel computer architectures. Its semantics is based on first order… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1984-2018
051019842018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
1993
1993
The rationale for 61 Concurrent Logic Progranzming language forReal-Tit~ze!iystems i centered on thP fornial foundation of Logic… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
The high complexity of distributed computer systems requires new programming languages and tools which will avoid many of the… (More)
Is this relevant?
1993
1993
One way to execute a program faster on a parallel computer is to allocate some processors to speculative computation: work which… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
1992
1992
This paper defines an abstract machine for implementing the logic language Parlog on shared memory multiprocessors. A process… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Review
1992
Review
1992
If you are familiar with Prolog but not with Parlog then this tutorial is aimed at you. In what follows I attempt to: • explain… (More)
  • table I
  • figure 1
  • figure 5
  • figure 6
  • figure 8
Is this relevant?
1989
1989
Since logic programs are executable specifications, the main concern of logic programming, producing efficient programs, is… (More)
Is this relevant?
1987
1987
Three similar parallel logic programming languages have been proposed; Parlog, Flat Concurrent Prolog, and Guarded Horn Clauses… (More)
  • figure 1
  • table I
  • table II
  • table III
  • table IV
Is this relevant?
1987
1987
Parlog, [1], is a formalism for expressing notions of concurrency and as such is designed for parallel execution. A goal clause… (More)
Is this relevant?
Review
1986
Review
1986
PARLOG is a logic programming language in the sense that nearly every definition and query can be read as a sentence of predicate… (More)
Is this relevant?
1985
1985
D In this paper we consider the implementation of PARLOG by showing how any PARLOG program can be compiled to a program in a… (More)
Is this relevant?