Abstract
In this chapter we recall some basic general facts about the proof complexity of resolution [Bla37, Rob65]. This will be a common background for the results in Chap. 3 and Chap. 8. First we describe the most common restrictions placed on the type of resolution refutations, that is regular and tree-like resolution refutations (Sect. 2.1), then we prove a non-trivial size upper bound (Sect. 2.2) and finally we move to the complexity measures known as width and asymmetric width (Sect. 2.3).
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
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Bonacina, I. (2017). Resolution. In: Space in Weak Propositional Proof Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-73453-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-73453-8_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73452-1
Online ISBN: 978-3-319-73453-8
eBook Packages: Computer ScienceComputer Science (R0)