Abstract
In Chapter 2 we have proved the correctness and completeness of the resolution principle. It might seem that these are already the key results of resolution theory. Although the (general) resolution principle is clearly superior to the PR-deduction principle and to methods based on Herbrand’s theorem, there are several reasons for further refining the deduction principle. First of all the high number of resolvents derivable from a set of clauses is a serious obstacle to practical applications. Thus it is significant that Robinson presented a paper on hyperresolution [Rob65a], a refinement to be described later, in the same year as his landmark paper on resolution [Rob65] was published. So one motivation for restricting the R-deduction principle is efficiency.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin
About this chapter
Cite this chapter
Leitsch, A. (1997). Refinements of Resolution. In: The Resolution Calculus. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60605-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-60605-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64473-3
Online ISBN: 978-3-642-60605-2
eBook Packages: Springer Book Archive