The limits of tractability in resolution-based propositional proof systems

Dantchev, Stefan and Martin, Barnaby (2011) The limits of tractability in resolution-based propositional proof systems. Annals of Pure and Applied Logic, 163 (6) . pp. 656-668. ISSN 0168-0072 [Article] (doi:10.1016/j.apal.2011.11.001)

Official URL: http://dx.doi.org/10.1016/j.apal.2011.11.001

Abstract

We study classes of propositional contradictions based on the Least Number Principle (LNP) in the refutation system of Resolution and its generalisations with bounded conjunction, Res(k).

Item Type:	Article
Additional Information:	Computability in Europe 2010
Keywords (uncontrolled):	propositional proof complexity; resolution with bounded conjunction; lower bounds
Research Areas:	A. > School of Science and Technology > Computer Science A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID:	9645
Depositing User:	Devika Mohan
Date Deposited:	20 Dec 2012 11:15
Last Modified:	24 Apr 2018 13:30
URI:	https://eprints.mdx.ac.uk/id/eprint/9645

Actions (login required)

View Item

Statistics

DownloadsShow export options

Activity Overview

6 month trend

0Downloads

6 month trend

364Hits

Additional statistics are available via IRStats2.

CORE (COnnecting REpositories)