Abstract
Set-of-support is an important restriction strategy for resolution-based automated theorem proving. Unfortunately, the potential benefit cannot always be exploited due to indeterminism in the selection of an optimal set-of-support and the potential loss of refutation completeness when combined with a powerful inference rule such as hyperresolution. We will present a method which allows to compute several sets-of-support in parallel and in a cooperative way, which allows to remedy the above problems and still avoids many redundant computations.
This work was supported by the Deutsche Forschungsgemeinschaft within the Sonderforschungsbereich 342, Teilprojekt A5 (Parallelization of Inference Systems).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C.-L. Chang and R. C.-T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973.
M. Grosse. Parallelization of Resolution-based Inference Systems and their Specification. Diploma Thesis, TU München, 1991.
M. Grosse and C.B. Suttner. A Parallel Algorithm for Set-of-Support. SFB Bericht 342/1/92 B, 1992.
E. Lusk, W. McCune, and R. Overbeek. ITP at Argonne National Laboratory. In Proc. of the 8. CADE, Springer LNCS 230:698–699, 1986.
W.W. McCune. Otter 2.0 users guide. Technical Report ANL-90/9, Argonne National Laboratory, 1990.
W.W. McCune and L. Wos. Experiments in Automated Deduction with Condensed Detachment. Technical report, Argonne National Lab., 1991.
J. A. Robinson. Automatic Deduction with Hyperresolution. International Journal of Computer Mathematics, 1:227–234, 1965.
J. A. Robinson. A Machine-oriented Logic Based on the Resolution Principle. Journal of the ACM, 12:23–41, 1965.
J. Slaney and E. Lusk. Parallelizing the Closure Computation in Automated Deduction. In Proc. of the 10. CADE, Springer LNAI 449, 1990.
L. Wos, D. Carson, and G. Robinson. Efficiency and Completeness of the Set-of-support Strategy in Theorem Proving. JACM 12(2):536–541, 1965.
L. Wos, R. Overbeek, E. Lusk, and J. Boyle. Automated Reasoning — Introduction and Applications. Prentice Hall, 1984.
L. Wos. Automated Reasoning: 33 Basic Research Problems. Prentice Hall, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suttner, C.B. (1992). Parallel computation of multiple sets-of-support. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013065
Download citation
DOI: https://doi.org/10.1007/BFb0013065
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55727-2
Online ISBN: 978-3-540-47279-7
eBook Packages: Springer Book Archive