Results 1  10
of
110
Interpolation and SATbased model checking
, 2003
"... Abstract. We consider a fully SATbased method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDDbased symbolic model checking, and compares f ..."
Abstract

Cited by 196 (9 self)
 Add to MetaCart
Abstract. We consider a fully SATbased method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDDbased symbolic model checking, and compares favorably to some recent SATbased model checking methods on positive instances. 1
Finding Hard Instances of the Satisfiability Problem: A Survey
, 1997
"... . Finding sets of hard instances of propositional satisfiability is of interest for understanding the complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we consider the performance of the most popular SAT algorithms on random problems, the theory of average case ..."
Abstract

Cited by 114 (1 self)
 Add to MetaCart
. Finding sets of hard instances of propositional satisfiability is of interest for understanding the complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we consider the performance of the most popular SAT algorithms on random problems, the theory of average case complexity, the threshold phenomenon, known lower bounds for certain classes of algorithms, and the problem of generating hard instances with solutions.
Some Consequences of Cryptographical Conjectures for . . .
, 1995
"... We show that there is a pair of disjoint NPsets, whose disjointness is provable in S 1 2 and which cannot be separated by a set in P=poly, if the cryptosystem RSA is secure. Further we show that factoring and the discrete logarithm are implicitly definable in any extension of S 1 2 admittin ..."
Abstract

Cited by 74 (8 self)
 Add to MetaCart
We show that there is a pair of disjoint NPsets, whose disjointness is provable in S 1 2 and which cannot be separated by a set in P=poly, if the cryptosystem RSA is secure. Further we show that factoring and the discrete logarithm are implicitly definable in any extension of S 1 2 admitting an NP definition of primes about which it can prove that no number satisfying the definition is composite. As a corollary we obtain that the Extended Frege (EF) proof system does not admit feasible interpolation theorem unless the RSA cryptosystem is not secure, and that an extension of EF by tautologies p (p primes), formalizing that p is not composite, as additional axioms does not admit feasible interpolation theorem unless factoring and the discrete logarithm are in P=poly . The NP 6= coNP conjecture is equivalent to the statement that no propositional proof system (as defined in [6]) admits polynomial size proofs of all tautologies. However, only for few proof systems occur...
On Interpolation and Automatization for Frege Systems
, 2000
"... The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds for the ..."
Abstract

Cited by 51 (7 self)
 Add to MetaCart
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds for the proof system, sometimes assuming a (usually modest) complexitytheoretic assumption. In this paper, we show that this method cannot be used to obtain lower bounds for Frege systems, or even for TC 0 Frege systems. More specifically, we show that unless factoring (of Blum integers) is feasible, neither Frege nor TC 0 Frege has the feasible interpolation property. In order to carry out our argument, we show how to carry out proofs of many elementary axioms/theorems of arithmetic in polynomial size TC 0 Frege. As a corollary, we obtain that TC 0 Frege as well as any proof system that polynomially simulates it, is not automatizable (under the assumption that factoring of Blum integ...
Space Bounds for Resolution
, 1999
"... We introduce a new way to measure the space needed in resolution refutations of CNF formulas in propositional logic. With the former definition [11] the space required for the resolution of any unsatisfiable formula in CNF is linear in the number of clauses. The new definition allows a much finer ..."
Abstract

Cited by 50 (3 self)
 Add to MetaCart
We introduce a new way to measure the space needed in resolution refutations of CNF formulas in propositional logic. With the former definition [11] the space required for the resolution of any unsatisfiable formula in CNF is linear in the number of clauses. The new definition allows a much finer analysis of the space in the refutation, ranging from constant to linear space. Moreover, the new definition allows to relate the space needed in a resolution proof of a formula to other well studied complexity measures. It coincides with the complexity of a pebble game in the resolution graphs of a formula, and as we show, has relationships to the size of the refutation. We also give upper and lower bounds on the space needed for the resolution of unsatisfiable formulas. We show that Tseitin formulas associated to a certain kind of expander graphs of n nodes need resolution space n \Gamma c for some constant c. Measured on the number of clauses, this result is the best possible. We also show that the formulas expressing the general Pigeonhole Principle with n holes and more than n pigeons, need space n + 1 independently of the number of pigeons. Since a matching space upper bound of n + 1 for these formulas exist, the obtained bound is exact. We also point to a possible connection between resolution space and resolution width, another measure for the complexity of resolution refutations. 3 1
Pseudorandom Generators Hard for kDNF Resolution and Polynomial Calculus Resolution
, 2003
"... A pseudorandom generator G n : f0; 1g is hard for a propositional proof system P if (roughly speaking) P can not ef ciently prove the statement G n (x 1 ; : : : ; x n ) 6= b for any string b 2 . We present a function (m 2 ) generator which is hard for Res( log n); here Res(k) is the ..."
Abstract

Cited by 41 (4 self)
 Add to MetaCart
A pseudorandom generator G n : f0; 1g is hard for a propositional proof system P if (roughly speaking) P can not ef ciently prove the statement G n (x 1 ; : : : ; x n ) 6= b for any string b 2 . We present a function (m 2 ) generator which is hard for Res( log n); here Res(k) is the propositional proof system that extends Resolution by allowing kDNFs instead of clauses.
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
, 2000
"... An exponential lower bound for the size of treelike Cutting Planes refutations of a certain family of CNF formulas with polynomial size resolution refutations is proved. This implies an exponential separation between the treelike versions and the daglike versions of resolution and Cutting Planes. ..."
Abstract

Cited by 39 (9 self)
 Add to MetaCart
An exponential lower bound for the size of treelike Cutting Planes refutations of a certain family of CNF formulas with polynomial size resolution refutations is proved. This implies an exponential separation between the treelike versions and the daglike versions of resolution and Cutting Planes. In both cases only superpolynomial separations were known [29, 18, 8]. In order to prove these separations, the lower bounds on the depth of monotone circuits of Raz and McKenzie in [25] are extended to monotone real circuits. An exponential separation is also proved between treelike resolution and several refinements of resolution: negative resolution and regular resolution. Actually this last separation also provides a separation between treelike resolution and ordered resolution, thus the corresponding superpolynomial separation of [29] is extended. Finally, an exponential separation between ordered resolution and unrestricted resolution (also negative resolution) is proved. Only a superpolynomial separation between ordered and unrestricted resolution was previously known [13].
Interpolantbased transition relation approximation
 In CAV 05: ComputerAided Verification, LNCS 3576
, 2005
"... Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, software model checkers typically use a weak approximation of the image. This can result in a failure to prove a property, ..."
Abstract

Cited by 38 (3 self)
 Add to MetaCart
Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, software model checkers typically use a weak approximation of the image. This can result in a failure to prove a property, even given an adequate set of predicates. We present an interpolantbased method for strengthening the abstract transition relation in case of such failures. This approach guarantees convergence given an adequate set of predicates, without requiring an exact image computation. We show empirically that the method converges more rapidly than an earlier method based on counterexample analysis. 1
On the Automatizability of Resolution and Related Propositional Proof Systems
, 2002
"... We analyse the possibility that a system that simulates Resolution is automatizable. We call this notion "weak automatizability". We prove ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
We analyse the possibility that a system that simulates Resolution is automatizable. We call this notion "weak automatizability". We prove