Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,384,112 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Admissible rule
Automated theorem proving
Computational complexity theory
Computer science
Expand
Broader (1)
Logic in computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Proof Complexity of QBF Symmetry Recomputation
Joshua Blinkhorn
,
Olaf Beyersdorff
International Conference on Theory and…
2019
Corpus ID: 121192352
For quantified Boolean formulas (QBF), a resolution system with a symmetry rule was recently introduced by Kauers and Seidl (Inf…
Expand
2015
2015
Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars
B. Afshari
,
Stefan Hetzl
,
Graham Emil Leigh
International Conference on Typed Lambda Calculus…
2015
Corpus ID: 2877945
Recently a new connection between proof theory and formal language theory was introduced. It was shown that the operation of cut…
Expand
2010
2010
Logical Foundations of Proof Complexity: INDEX
Stephen A. Cook
,
P. Nguyen
,
+9 authors
Phuong Nguyen Frontmatter
2010
Corpus ID: 117487880
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The…
Expand
2009
2009
On optimal heuristic randomized semidecision procedures, with application to proof complexity
E. Hirsch
,
D. Itsykson
Symposium on Theoretical Aspects of Computer…
2009
Corpus ID: 16870117
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture…
Expand
2007
2007
Report on the SAT 2007 Conference on Theory and Applications of Satisfiability Testing
Joao Marques-Silva
,
K. Sakallah
,
I. Lynce
The AI Magazine
2007
Corpus ID: 37137318
The SAT Conference on Theory and Applications of Satisfiability Testing was held in Lisbon, Portugal, 28-31 May 2007. The…
Expand
2006
2006
Preference-Based Inconsistency Proving: When the Failure of the Best Is Sufficient
Ulrich Junker
European Conference on Artificial Intelligence
2006
Corpus ID: 3009878
Inconsistency proving of CSPs is typically achieved by a combination of systematic search and arc consistency, which can both be…
Expand
2005
2005
'Out in the Dark': An Exploration of and Creative Response to the Process of Poetic Composition with Reference to Edward Thomas and a Self-reflexive Study
J. Kendall
2005
Corpus ID: 146827892
Research through practice into the actual process of composing, such as William James on automatic writing and thought processes…
Expand
2002
2002
On Complexity gaps for Resolution-based proof systems
Stefan S. Dantchev
,
Søren Riis
2002
Corpus ID: 18742307
We study the proof complexity of , the class of SecondOrder Existential (SO ) logical sentences which fail in all finite models…
Expand
1998
1998
CDT: A Tool for Agent Conversation Design
M. Greaves
,
H. Holmback
,
J. Bradshaw
1998
Corpus ID: 16988931
The design, implementation, and verification of agent conversations (i.e., multiagent sequences of language primitives which are…
Expand
1996
1996
The beginnings of Western music in Meiji Era Japan : thesis submitted for the degree "doctor of philosophy" : submitted to the Senate of Tel-Aviv University
1996
Corpus ID: 68744028
This volume investigates the introduction of Western music into the educational system of Japan and reveals the existence of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required