|
Zapiski Nauchnykh Seminarov POMI, 2012, Volume 407, Pages 111–128
(Mi znsl5488)
|
|
|
|
Cut for resolution method
V. P. Orevkov St. Petersburg Department of the Steklov Mathematical Institute, St. Petersburg, Russia
Abstract:
The aim of this talk is to extended Resolution Method by new rule, which simulate cut. We also will obtain upper and lower bounds on the complexity of refutation with and without this rule.
Key words and phrases:
resolution method, refutation, cut, sequent, upper bound, lower bound.
Received: 16.04.2012
Citation:
V. P. Orevkov, “Cut for resolution method”, Studies in constructive mathematics and mathematical logic. Part XII, Zap. Nauchn. Sem. POMI, 407, POMI, St. Petersburg, 2012, 111–128; J. Math. Sci. (N. Y.), 199:1 (2014), 56–65
Linking options:
https://www.mathnet.ru/eng/znsl5488 https://www.mathnet.ru/eng/znsl/v407/p111
|
Statistics & downloads: |
Abstract page: | 214 | Full-text PDF : | 90 | References: | 40 |
|