Using Hundreds of Workstations to Solve First-Order Logic Problems
Abstract
This paper describes a distributed, adaptive, first-order logic engine with exceptional performance characteris-tics. The system combines serial search reduction tech-niques such as bounded-overhead subgoal caching and intelligent backtracking with a novel parallelization strategy particularly well-suited to coarse-grained paral-lel execution on a network of workstations. We present empirical results that demonstrate our system’s perfor-mance using 100 workstations on over 1400 first-order logic problems drawn from the “Thousands of Prob-lems for Theorem Provers ” collection. utroduction We have developed an distributed, adaptive, first-order logic engine as the core of a planning system intended to solve
Cite
Text
Segre and Sturgill. "Using Hundreds of Workstations to Solve First-Order Logic Problems." AAAI Conference on Artificial Intelligence, 1994.Markdown
[Segre and Sturgill. "Using Hundreds of Workstations to Solve First-Order Logic Problems." AAAI Conference on Artificial Intelligence, 1994.](https://mlanthology.org/aaai/1994/segre1994aaai-using/)BibTeX
@inproceedings{segre1994aaai-using,
title = {{Using Hundreds of Workstations to Solve First-Order Logic Problems}},
author = {Segre, Alberto Maria and Sturgill, David B.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1994},
pages = {187-192},
url = {https://mlanthology.org/aaai/1994/segre1994aaai-using/}
}