Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,515,737 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.
2017
2017
Reasons for Hardness in Quantified Boolean Formulas ?
Olaf Beyersdorff
,
Luke Hinde
,
J. Pich
2017
Corpus ID: 46339665
We aim to understand inherent reasons for lower bounds for QBF proof systems, and revisit and compare two previous approaches in…
Expand
Review
2014
Review
2014
A (Biased) Proof Complexity Survey for SAT Practitioners
Jakob Nordström
International Conference on Theory and…
2014
Corpus ID: 15619285
This talk is intended as a selective survey of proof complexity, focusing on some comparatively weak proof systems that are of…
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
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
2004
2004
The Complexity of Modified Instances
P. Liberatore
arXiv.org
2004
Corpus ID: 7879792
In this paper we study the complexity of solving a problem when a solution of a similar instance is known. This problem is…
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
2001
2001
A Methodology for Deductive Verification of Out-of-Order Execution Systems Based on Predicted Values,
T. Arons
,
A. Pnueli
2001
Corpus ID: 13058864
In this paper we propose a methodology for the deductive verification of out-of-order scheduling algorithms. A `top-down'' scheme…
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