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.

2019

For quantified Boolean formulas (QBF), a resolution system with a symmetry rule was recently introduced by Kauers and Seidl (Inf…

2015

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

2010

This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The…

2009

The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture…

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 define the notion of the uniform reduct of a propositional proof system as the set of those bounded formulas in the language…

2005

Research through practice into the actual process of composing, such as William James on automatic writing and thought processes…

1998

Circumscription is a non-monotonic formalism based on the idea that objects satisfying a certain predicate expression are…

1978

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