Abstract
A method is developped of how to extend theorem provers in order to decide satisfiability for every formula of prefix type AE…E. The key idea is to find a certain criterion for the existence of loops in the search tree. As a byproduct a result on proof complexity is derived.
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
B. Dreben and W. D. Goldfarb, The decision problem. Solvable classes of quantificational formulas, Addison-Wesley (1979).
W. H. Joyner Jr., Resolution strategies as decision procedures, J.ACM 23(1976), 398–417.
H. R. Lewis, Complexity results for classes of quantificational formulas, J.Comp.Syst.Sci. 21(1980), 317–353.
W. Schonfeld, Gleichungen in der Algebra der binaren Relationen, Habilitationsschrift, Universität Stuttgart (1979).
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
Schönfeld, W. (1983). Proof Search for Unprovable Formulas. In: Neumann, B. (eds) GWAI-83. Informatik-Fachberichte, vol 76. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69391-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-69391-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12871-7
Online ISBN: 978-3-642-69391-5
eBook Packages: Springer Book Archive