Interdisciplinary Information Sciences
Online ISSN : 1347-6157
Print ISSN : 1340-9050
ISSN-L : 1340-9050

この記事には本公開記事があります。本公開記事を参照してください。
引用する場合も本公開記事を引用してください。

An Introduction to Lower Bounds on Resolution Proof Systems
Kazuhisa SETO
著者情報
ジャーナル フリー 早期公開

論文ID: 2015.L.02

この記事には本公開記事があります。
詳細
抄録
Proof complexity, a measure to estimate the sizes of proofs in propositional logics, is studied as one of the fundamental approaches to the \mathcal{P} versus \mathcal{NP} problem, and has some practical applications such as automated theorem proving. It is a very hard task to prove lower bounds on strong proof systems such as Frege systems, for which no non-trivial lower bound is known yet. On the other hand, we have some rich success stories on weaker proof systems such as resolution proof systems. In this paper, we focus on resolution proof systems and review some of the existing techniques for proving lower bounds.
著者関連情報
© 2015 by the Graduate School of Information Sciences (GSIS), Tohoku University

This article is licensed under a Creative Commons [Attribution 4.0 International] license.
https://creativecommons.org/licenses/by/4.0/
feedback
Top