Proof complexity

Known as: Proof

In computer science, proof complexity is a measure of efficiency of automated theorem proving methods that is based on the size of the proofs they…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

Recently a new connection between proof theory and formal language theory was introduced. It was shown that the operation of cut…

2011

The aim of this paper is to propose a proof-complexity framework for concurrent automata. Since the behavior of concurrent…

2007

We study—within the framework of propositional proof complexity—the problem of certifying unsatisfiability of CNF formulas under…

2006

Inconsistency proving of CSPs is typically achieved by a combination of systematic search and arc consistency, which can both be…

2005

We present a method—called quantifier tree reconstruction—that allows to efficiently recover ex-post a portion of the internal…

2002

We present the first example of a natural distribution on instances of an NP-complete problem, with the following properties…

1999

We present a translation of intuitionistic sequent proofs from a multi-succedent calculus LJ mc into a single-succedent calculus…

1998

1996

This volume investigates the introduction of Western music into the educational system of Japan and reveals the existence of…

1978

SummaryWe consider the specification and verification of cyclic (sequential and concurrent) programs. The input-output based…