Parallelization in Inference Systems pp 139-162 | Cite as

# Experiments with Roo, a parallel automated deduction system

Conference paper

First Online:

## Preview

Unable to display preview. Download preview PDF.

## References

- [1]W. Bledsoe. Challenge problems in elementary calculus.
*Journal of Automated Reasoning*, 6(3):341–359, 1990.Google Scholar - [2]J. Christian. Fast Knuth-Bendix completion: A summary. In N. Dershowitz, editor,
*Proceedings of the 3rd International Conference on Rewriting Techniques and Applications*,*Lecture Notes in Computer Science, Vol. 355*, pages 551–555, New York, 1989. Springer-Verlag.Google Scholar - [3]J. Guard, F. Oglesby, J. Bennett, and L. Settle. Semi-automated mathematics.
*Journal of the ACM*, 16(1):49–62, 1969.Google Scholar - [4]J. A. Kalman. Axiomatizations of logics with values in groups.
*Journal of the London Math. Society*, 2(14):193–199, 1975.Google Scholar - [5]J. Lukasiewicz.
*Selected Works*. North-Holland, 1970. Edited by L. Borkowski.Google Scholar - [6]E. Lusk, W. McCune, and R. Overbeek. Logic Machine Architecture: Inference mechanisms. In D. Loveland, editor,
*Proceedings of the 6th Conference on Automated Deduction*,*Lecture Notes in Computer Science, Vol. 138*, pages 85–108, New York, 1982. Springer-Verlag.Google Scholar - [7]E. Lusk, W. McCune, and R. Overbeek. Logic Machine Architecture: Kernel functions. In D. Loveland, editor,
*Proceedings of the 6th Conference on Automated Deduction*,*Lecture Notes in Computer Science, Vol. 138*, pages 70–84, New York, 1982. Springer-Verlag.Google Scholar - [8]E. Lusk, W. McCune, and J. Slaney. High-performance parallel theorem proving for shared-memory multiprocessors. Preprint, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1991. In preparation.Google Scholar
- [9]E. Lusk, W. McCune, and J. Slaney. ROO—a parallel theorem prover. Tech. Memo. MCS-TM-149, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1991. To appear.Google Scholar
- [10]E. Lusk and R. McFadden. Using automated reasoning tools: A study of the semigroup F2B2.
*Semigroup Forum*, 36(1):75–88, 1987.Google Scholar - [11]E. Lusk and R. Overbeek. The automated reasoning system ITP. Tech. Report ANL-84/27, Argonne National Laboratory, Argonne, IL, April 1984.Google Scholar
- [12]W. McCune. otter 2.0 Users Guide. Tech. Report ANL-90/9, Argonne National Laboratory, Argonne, IL, March 1990.Google Scholar
- [13]W. McCune. Single axioms for the left group and right group calculi. Preprint MCS-P219-0391, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1991.Google Scholar
- [14]W. McCune. What's new in otter 2.2. Tech. Memo. ANL/MCS-TM-153, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, July 1991.Google Scholar
- [15]F. Pfenning. Single axioms in the implicational propositional calculus. In E. Lusk and R. Overbeek, editors,
*Proceedings of the 9th International Conference on Automated Deduction*,*Lecture Notes in Computer Science, Vol. 310*, pages 710–713, New York, 1988. Springer-Verlag.Google Scholar - [16]L. Sallows. A curious new result in switching theory.
*The Mathematical Intelligencer*, 12(1):21–32, 1990.Google Scholar - [17]J. Schumann and R. Letz. PARTHEO: A high-performance parallel theorem prover. In M. Stickel, editor,
*Proceedings of the 10th International Conference on Automated Deduction*,*Lecture Notes in Artificial Intelligence, Vol. 449*, pages 40–56, New York, July 1990. Springer-Verlag.Google Scholar - [18]J. Slaney and E. Lusk. Parallelizing the closure computation in automated deduction. In M. Stickel, editor,
*Proceedings of the 10th International Conference on Automated Deduction*,*Lecture Notes in Artificial Intelligence, Vol. 449*, pages 28–39, New York, July 1990. Springer-Verlag.Google Scholar - [19]M. Stickel. A Prolog Technology Theorem Prover: Implementation by an extended Prolog compiler.
*Journal of Automated Reasoning*, 4(4):353–380, 1988.Google Scholar - [20]S. Winker. Robbins algebra: Conditions that make a near-boolean algebra boolean.
*Journal of Automated Reasoning*, 6(4):465–489, 1990.Google Scholar - [21]L. Wos, R. Overbeek, E. Lusk, and J. Boyle.
*Automated Reasoning: Introduction and Applications*. Prentice-Hall, Englewood Cliffs, NJ, 1984.Google Scholar - [22]L. Wos, G. Robinson, and D. Carson. Efficiency and completeness of the set of support strategy in theorem proving.
*J. ACM*, 12(4):536–541, 1965.Google Scholar - [23]L. Wos, S. Winker, and E. Lusk. An automated reasoning system. In
*Proceedings of the National Computer Conference*, pages 697–702. AFIPS, 1981.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1992