Results 1  10
of
284
On the complexity of finding narrow proofs
 In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS ’12
, 2012
"... ar ..."
Narrow proofs may be . . .
"... We prove that there are 3CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size nΩ(w). This shows that the simple counting argument that any formula refutable in width w must have a proof in size nO(w) is essentially tight. Moreover, our lo ..."
Abstract
 Add to MetaCart
We prove that there are 3CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size nΩ(w). This shows that the simple counting argument that any formula refutable in width w must have a proof in size nO(w) is essentially tight. Moreover, our
Narrow proofs may be maximally long.
 In Proceedings of the 29th Annual IEEE Conference on Computational Complexity (CCC ’14),
, 2014
"... Abstract We prove that there are 3CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n Ω(w) . This shows that the simple counting argument that any formula refutable in width w must have a proof in size n is essentially tight. Moreover, ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract We prove that there are 3CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n Ω(w) . This shows that the simple counting argument that any formula refutable in width w must have a proof in size n is essentially tight. Moreover
On IP=PSPACE and theorems with narrow proofs
 EATCS Bulletin
"... It has been shown that the class of languages with interactive proofs, IP, is exactly the class PSPACE. This surprising result elegantly places IP in the standard classification of feasible computations. Furthermore, the IP = PSPACE result reveals some very interesting and unsuspected properties of ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
It has been shown that the class of languages with interactive proofs, IP, is exactly the class PSPACE. This surprising result elegantly places IP in the standard classification of feasible computations. Furthermore, the IP = PSPACE result reveals some very interesting and unsuspected properties
On IP = PSPACE and Theorems with Narrow Proofs
, 1990
"... It has been shown that the class of languages with interactive proofs, IP, is exactly the class PSPACE. This surprising result elegantly places IP in the standard classification of feasible computations. Furthermore, the IP = PSPACE result reveals some very interesting and unsuspected properties of ..."
Abstract
 Add to MetaCart
It has been shown that the class of languages with interactive proofs, IP, is exactly the class PSPACE. This surprising result elegantly places IP in the standard classification of feasible computations. Furthermore, the IP = PSPACE result reveals some very interesting and unsuspected properties
Narrow proofs may be spacious: Separating space and width in resolution (Extended Abstract)
 REVISION 02, ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY (ECCC
, 2005
"... The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if the proof is only allowed to infer new clauses from clauses currently in memory. Both of these measures have previously ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if the proof is only allowed to infer new clauses from clauses currently in memory. Both of these measures have
Short Proofs are Narrow  Resolution made Simple
 Journal of the ACM
, 2000
"... The width of a Resolution proof is de ned to be the maximal number of literals in any clause of the proof. In this paper we relate proof width to proof length (=size), in both general Resolution, and its treelike variant. The following consequences of these relations reveal width as a crucial " ..."
Abstract

Cited by 205 (14 self)
 Add to MetaCart
The width of a Resolution proof is de ned to be the maximal number of literals in any clause of the proof. In this paper we relate proof width to proof length (=size), in both general Resolution, and its treelike variant. The following consequences of these relations reveal width as a crucial
On Narrowing, Refutation Proofs and Constraints
 Rewriting Techniques and Applications, 6th International Conferenc e, RTA95, LNCS 914
, 1995
"... . We develop a proof technique for dealing with narrowing and refutational theorem proving in a uniform way, clarifying the exact relationship between the existing results in both fields and allowing us to obtain several new results. Refinements of narrowing (basic, LSE, etc.) are instances of the t ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
. We develop a proof technique for dealing with narrowing and refutational theorem proving in a uniform way, clarifying the exact relationship between the existing results in both fields and allowing us to obtain several new results. Refinements of narrowing (basic, LSE, etc.) are instances
On the Connection between Narrowing and Proof by Consistency
 Verlag in the series Lecture Notes in Computer Science
, 1994
"... We study the connection between narrowing and a method for proof by consistency due to Bachmair, and we show that narrowing and proof by consistency may be used to simulate each other. This allowsforthemigration of results between the two process descriptions. We obtain decidability results for vali ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We study the connection between narrowing and a method for proof by consistency due to Bachmair, and we show that narrowing and proof by consistency may be used to simulate each other. This allowsforthemigration of results between the two process descriptions. We obtain decidability results
Results 1  10
of
284