Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
For quantified Boolean formulas (QBF), a resolution system with a symmetry rule was recently introduced by Kauers and Seidl (Inf… 
2015
2015
Recently a new connection between proof theory and formal language theory was introduced. It was shown that the operation of cut… 
2010
2010
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The… 
2009
2009
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture… 
2007
2007
The SAT Conference on Theory and Applications of Satisfiability Testing was held in Lisbon, Portugal, 28-31 May 2007. The… 
2006
2006
Inconsistency proving of CSPs is typically achieved by a combination of systematic search and arc consistency, which can both be… 
2005
2005
Research through practice into the actual process of composing, such as William James on automatic writing and thought processes… 
2002
2002
We study the proof complexity of , the class of SecondOrder Existential (SO ) logical sentences which fail in all finite models… 
1998
1998
The design, implementation, and verification of agent conversations (i.e., multiagent sequences of language primitives which are… 
1996
1996
  • 1996
  • Corpus ID: 68744028
This volume investigates the introduction of Western music into the educational system of Japan and reveals the existence of…