Results 1 
9 of
9
A High Performance ORparallel Prolog System
, 1992
"... PROLOG, the most popular logic programming language, has been developed for singleprocessor computers. The implementations of sequential Prolog became efficient with the development of the Warren Abstract Machine (WAM) and are still improving. Today many parallel computers are commercially availabl ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
PROLOG, the most popular logic programming language, has been developed for singleprocessor computers. The implementations of sequential Prolog became efficient with the development of the Warren Abstract Machine (WAM) and are still improving. Today many parallel computers are commercially available and the question is how to utilize this opportunity to speed up the execution of Prolog programs. Our approach has been to study and develop efficient techniques for implementing ORparallel systems for the full Prolog language on UMA and NUMA computers. Based on those techniques a high performance ORparallel Prolog system has been designed and implemented on six different parallel computers. The system has a number of processes, called workers, consisting of two components: the engine, which does the actual Prolog work, and the scheduler. The schedulers, working together, divide the available work between the engines and support the sequential semantics of Prolog. We have extended th...
Automated Reasoning and Bledsoe's Dream for the Field
"... In one sense, this article is a personal tribute to Woody Bledsoe. As such, the style will in general be that of private correspondence. However, since this article is also a compendium of experiments with an automated reasoning program, researchers interested in automated reasoning, mathematics, an ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
In one sense, this article is a personal tribute to Woody Bledsoe. As such, the style will in general be that of private correspondence. However, since this article is also a compendium of experiments with an automated reasoning program, researchers interested in automated reasoning, mathematics, and logic will find pertinent material here. The results of those experiments strongly suggest that research frequently benefits greatly from the use of an automated reasoning program. As evidence, I select from those results some proofs that are better than one can find in the literature, and focus on some theorems that, until now, had never been proved with an automated reasoning program, theorems that Hilbert, Church, and various logicians thought significant. To add spice to the article, I present challenges for reasoning programs, including questions that are still open. 1 This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Depa...
Parallelizing the closure computation in automated deduction
 Proceedings of the 10th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence
, 1990
"... In this paper we present a parallel algorithm for computing the closure of a set under an operation. This particular type of computation appears in a variety of disguises, and has been used in automated theorem proving, abstract algebra, and formal logic. The algorithm we give here is particularly s ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
In this paper we present a parallel algorithm for computing the closure of a set under an operation. This particular type of computation appears in a variety of disguises, and has been used in automated theorem proving, abstract algebra, and formal logic. The algorithm we give here is particularly suited for sharedmemory parallel computers, where it makes possible economies of space. Implementations of the algorithm in two application contexts are described and experimental results given. 1
p4Linda: A portable implementation of Linda
 Proceedings of the Second International Symposium on HighPerformance Distributed Computing. IEEE Computer
, 1993
"... ..."
Author manuscript, published in "Foundations of Computational Mathematics, Rio de Janeiro: Brazil (1997)" Algorithms for computing finite semigroups
, 2007
"... The aim of this paper is to present algorithms to compute finite semigroups. The semigroup is given by a set of generators taken in a larger semigroup, called the “universe”. This universe can be for instance the semigroup of all functions, partial functions, or relations on the set {1,..., n}, or t ..."
Abstract
 Add to MetaCart
The aim of this paper is to present algorithms to compute finite semigroups. The semigroup is given by a set of generators taken in a larger semigroup, called the “universe”. This universe can be for instance the semigroup of all functions, partial functions, or relations on the set {1,..., n}, or the semigroup of n × n matrices with entries in a given finite semiring. The algorithm produces simultaneously a presentation of the semigroup by generators and relations, a confluent rewriting system for this presentation and the Cayley graph of the semigroup. The elements of the semigroup are identified with the reduced words of the rewriting system. We also give some efficient algorithms to compute the Green relations, the local subsemigroups and the syntactic quasiorder of a subset of the semigroup. 1
Logical Basis for the Automation of Reasoning: Case Studies 1
"... 2.1 Components of the clause language paradigm.................................... 4 ..."
Abstract
 Add to MetaCart
2.1 Components of the clause language paradigm.................................... 4
Logical Basis for the Automation of Reasoning: Case Studies
"... Contents 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2 The clause language paradigm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ..."
Abstract
 Add to MetaCart
Contents 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2 The clause language paradigm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.1 Components of the clause language paradigm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Interplay of the components . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3 A fragment of the history of automated reasoning 19602002 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4 Answering open questions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.1 Robbins algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Performance of Muse on SwitchBased Multiprocessor Machines
, 1992
"... This paper discusses the implementation and performance results of the Muse system on switchbased multiprocessors (the BBN Butterfly GP1000 and TC2000). The results of Muse execution show that high real speedups can be achieved for Prolog programs that exhibit coarsegrained parallelism. The schedu ..."
Abstract
 Add to MetaCart
This paper discusses the implementation and performance results of the Muse system on switchbased multiprocessors (the BBN Butterfly GP1000 and TC2000). The results of Muse execution show that high real speedups can be achieved for Prolog programs that exhibit coarsegrained parallelism. The scheduling overhead is equivalent to around 8  26 Prolog procedure calls per task on the TC2000. The paper also compares the Muse results with corresponding results for the Aurora ORparallel Prolog system. For a large set of benchmarks, the results are in favor of the Muse system. Contents