Unrestricted vs restricted cut in a tableau method for Boolean circuits (2005)
Cached
Download Links
| Venue: | In: AI&M 2004, 8th International Symposium on Artificial Intelligence and Mathematics |
| Citations: | 16 - 4 self |
BibTeX
@INPROCEEDINGS{Järvisalo05unrestrictedvs,
author = {Matti Järvisalo and Tommi A. Junttila and Ilkka Niemelä},
title = { Unrestricted vs restricted cut in a tableau method for Boolean circuits},
booktitle = {In: AI&M 2004, 8th International Symposium on Artificial Intelligence and Mathematics},
year = {2005},
pages = {373--399},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in several natural ways. The results show that the unrestricted cut rule can be exponentially more effective than any of the considered restrictions. Moreover, there are exponential differences between the restricted versions, too. The results also apply to the Davis-Putnam procedure for conjunctive normal form formulae obtained from Boolean circuits with a standard linear size translation.
