Abstract
A modification of the clausal normal form algorithm is presented that allows for a controlled splitting of problems into independent subproblems. This method enabled the Markgraf Karl theorem proving system to prove some rather difficult theorems that it could not solve otherwise.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. Bledsoe: Splitting and Reduction Heuristics in Automatic Theorem Proving AI Journal 2, pp. 55–77, 1971
D. de Champeaux: Challenge Problem 1 without Search SIGART Newsletter 76, pp. 12–13, April 1981
G. Ernst The Utility of Independent Subgoals in Theorem Proving Information and Control 18, pp. 237–252, 1971
L. Henschen et al. Challenge Problem 1 SIGART Newsletter 72, pp. 30–31, July 1980
D. Loveland: Automated Theorem Proving: A Logical Basis North Holland, New York, 1978
Karl Mark G. Raph: The Markgraf Karl Refutation Procedure: Spring 1983 Internal Report, University of Karlsruhe, 1983
A. Nevins: A Relaxation Approach to Splitting in an Automatic Theorem Prover AI Journal 6, pp. 25–39, 1975
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Eisinger, N., Weigele, M. (1983). A Technical Note on Splitting and Clausal Normal Form Algorithms. In: Neumann, B. (eds) GWAI-83. Informatik-Fachberichte, vol 76. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69391-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-69391-5_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12871-7
Online ISBN: 978-3-642-69391-5
eBook Packages: Springer Book Archive