Abstract
We have implemented a model-generation based parallel theorem prover in KL1 on a parallel inference machine, PIM. We have developed several techniques to improve the efficiency of forward reasoning theorem provers based on lazy model generation. The tasks of the model-generation based prover are the generation and testing of atoms to be the elements of a model for the given theorem. The problem with this method is the explosion in the number of generated atoms and in the computational cost in time and space, incurred by the generation processes. Lazy model generation is a new method that avoids the generation of unnecessary atoms that are irrelevant to obtaining proofs, and to provide flexible control for the efficient use of resources in a parallel environment. With this method we have achieved a more than one-hundred-fold speedup on a PIM consisting of 128 PEs.
Preview
Unable to display preview. Download preview PDF.
References
H. Fujita and R. Hasegawa, A Model-Generation Theorem Prover in KL1 Using Ramified Stack Algorithm, In Proc. of the Eighth International Conference on Logic Programming, The MIT Press, 1991.
R. Hasegawa, A Parallel Model Generation Theorem Prover: MGTP and Further Research Plan, In Proc. of the Joint American-Japanese Workshop on Theorem Proving, Argonne, Illinois, 1991.
R. Hasegawa, M. Koshimura and H. Fujita, Lazy Model Generation for Improving the Efficiency of Forward Reasoning Theorem Provers, ICOT TR-751, 1992.
R. Manthey and F. Bry, Satchmo: a theorem prover implemented in Prolog, In Proc. of CADE 88, Argonne, Illinois, 1988.
W. W. McCune, OTTER 2.0 Users Guide, Argonne National Laboratory, 1990.
R. Overbeek, Challenge Problems, (private communication) 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hasegawa, R., Koshimura, M., Fujita, H. (1992). MGTP: A parallel theorem prover based on lazy model generation. In: Kapur, D. (eds) Automated Deduction—CADE-11. CADE 1992. Lecture Notes in Computer Science, vol 607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55602-8_223
Download citation
DOI: https://doi.org/10.1007/3-540-55602-8_223
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55602-2
Online ISBN: 978-3-540-47252-0
eBook Packages: Springer Book Archive