Results 1 
8 of
8
Monitors, Messages, and Clusters: the p4 Parallel Programming System
"... p4 is a portable library of C and Fortran subroutines for programming parallel computers. It is the current version of a system that has been in use since 1984. It includes features for explicit parallel programming of sharedmemory machines, distributedmemory machines (including heterogeneous netw ..."
Abstract

Cited by 109 (10 self)
 Add to MetaCart
p4 is a portable library of C and Fortran subroutines for programming parallel computers. It is the current version of a system that has been in use since 1984. It includes features for explicit parallel programming of sharedmemory machines, distributedmemory machines (including heterogeneous networks of workstations), and clusters, by which we mean sharedmemory multiprocessors communicating via message passing. We discuss here the design goals, history, and system architecture of p4 and describe briefly a diverse collection of applications that have demonstrated the utility of p4. 1 Introduction p4 is a library of routines designed to express a wide variety of parallel algorithms portably, efficiently and simply. The goal of portability requires it to use widely accepted models of computation rather than specific vendor implementations of those models. The goal of efficiency requires it to use models of computation relatively close to those provided by the machines themselves and t...
The TPTP Problem Library
, 1999
"... This report provides a detailed description of the TPTP Problem Library for automated theorem proving systems. The library is available via Internet, and forms a common basis for development of and experimentation with automated theorem provers. This report provides: ffl the motivations for buildin ..."
Abstract

Cited by 100 (6 self)
 Add to MetaCart
This report provides a detailed description of the TPTP Problem Library for automated theorem proving systems. The library is available via Internet, and forms a common basis for development of and experimentation with automated theorem provers. This report provides: ffl the motivations for building the library; ffl a discussion of the inadequacies of previous problem collections, and how these have been resolved in the TPTP; ffl a description of the library structure, including overview information; ffl descriptions of supplementary utility programs; ffl guidelines for obtaining and using the library; Contents 1 Introduction 2 1.1 Previous Problem Collections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 What is Required? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2 Inside the TPTP 6 2.1 The TPTP Domain Structure . . . . . . . . . . . . . . . . . . . . . ...
Otter: The CADE13 Competition Incarnations
 JOURNAL OF AUTOMATED REASONING
, 1997
"... This article discusses the two incarnations of Otter entered in the CADE13 Automated Theorem Proving Competition. Also presented are some historical background, a summary of applications that have led to new results in mathematics and logic, and a general discussion of Otter. ..."
Abstract

Cited by 44 (3 self)
 Add to MetaCart
This article discusses the two incarnations of Otter entered in the CADE13 Automated Theorem Proving Competition. Also presented are some historical background, a summary of applications that have led to new results in mathematics and logic, and a general discussion of Otter.
A Taxonomy of Parallel Strategies for Deduction
 Annals of Mathematics and Artificial Intelligence
, 1999
"... This paper presents a taxonomy of parallel theoremproving methods based on the control of search (e.g., masterslaves versus peer processes), the granularity of parallelism (e.g., fine, medium and coarse grain) and the nature of the method (e.g., orderingbased versus subgoalreduction) . We anal ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
This paper presents a taxonomy of parallel theoremproving methods based on the control of search (e.g., masterslaves versus peer processes), the granularity of parallelism (e.g., fine, medium and coarse grain) and the nature of the method (e.g., orderingbased versus subgoalreduction) . We analyze how the di#erent approaches to parallelization a#ect the control of search: while fine and mediumgrain methods, as well as masterslaves methods, generally do not modify the sequential search plan, parallelsearch methods may combine sequential search plans (multisearch) or extend the search plan with the capability of subdividing the search space (distributed search). Precisely because the search plan is modified, the latter methods may produce radically di#erent searches than their sequential base, as exemplified by the first distributed proof of the Robbins theorem generated by the Modified ClauseDi#usion prover Peersmcd. An overview of the state of the field and directions...
Uniform Strategies: The CADE11 Theorem Proving Contest
 Journal of Automated Reasoning
, 1993
"... . At CADE10 Ross Overbeek proposed a twopart contest to stimulate and reward work in automated theorem proving. The first part consists of seven theorems to be proved with resolution, and the second part of equational theorems. Our theorem provers Otter and its parallel child Roo proved all of th ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
. At CADE10 Ross Overbeek proposed a twopart contest to stimulate and reward work in automated theorem proving. The first part consists of seven theorems to be proved with resolution, and the second part of equational theorems. Our theorem provers Otter and its parallel child Roo proved all of the resolution theorems and half of the equational theorems. This paper represents a family of entries in the contest. Key Words. Automated theorem proving, resolution, paramodulation, KnuthBendix completion, strategy. 1 Introduction The Conference on Automated Deduction (CADE) has been for nearly twenty years a meeting where both theoreticians and practitioners present their work. Feeling perhaps that the conference was becoming dominated by the theoreticians, Ross Overbeek proposed at CADE10 in 1990 a contest to stimulate work on the implementation and use of automated theoremproving systems. The challenge was to prove a set of theorems, and do so with a uniform approach. That is, one w...
An Entry in the 1992 Overbeek TheoremProving Contest
, 1992
"... 1 1 Introduction 1 2 Results 1 3 Settings and Set of Support 2 3.1 Settings for the Basic Set : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 3.2 Settings for the Equality Set : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 3.3 Description of the Settings : : : : : : : : : : : : : ..."
Abstract
 Add to MetaCart
1 1 Introduction 1 2 Results 1 3 Settings and Set of Support 2 3.1 Settings for the Basic Set : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 3.2 Settings for the Equality Set : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 3.3 Description of the Settings : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 4 Failures on Equality Theorems 610 5 5 Summary of Otter Outputs for the Basic Set 6 5.1 Theorem 1: x 2 = e Groups are Commutative (Pform) : : : : : : : : : : : : 6 5.2 Theorem 2: The Commutator Theorem (Pform) : : : : : : : : : : : : : : : 8 5.3 Theorem 3: x 2 = x Rings are Commutative (Pform) : : : : : : : : : : : : : 11 5.4 Theorem 4: Equivalential Calculus, XGK ! PYO : : : : : : : : : : : : : : 14 5.5 Theorem 5: Implicational Calculus Single Axiom, CD67 (Imp4) : : : : : : 16 5.6 Theorem 6: Manyvalued Sentential Calculus, CD57 : : : : : : : : : : : : : 19 5.7 Theorem 7: Manyvalued Sentential Calculus, CD60 : : : : : : : : : : : : : 21 6 Su...
Smart Selective Competition Parallelism ATP
"... This paper describes the Smart Selective Competition Parallelism ATP system SSCPA, an uncooperative multiple calculus competition parallelism ATP system, that multitasks on a single CPU. SSCPA runs multiple sequential ATP systems in parallel, using performance data from the ATP systems to select tho ..."
Abstract
 Add to MetaCart
This paper describes the Smart Selective Competition Parallelism ATP system SSCPA, an uncooperative multiple calculus competition parallelism ATP system, that multitasks on a single CPU. SSCPA runs multiple sequential ATP systems in parallel, using performance data from the ATP systems to select those that are best suited to the problem.