Results 1  10
of
261,873
Resolution Proof Systems with Weak
"... In the previous papers [7101 we defined and explored a formal methodological framework on the basis of which resolution proof systems for stronglyfinite logics can be introduced and studied. In the present paper we extend this approach to a wider class of the socalled resolution logics. 1 ..."
Abstract
 Add to MetaCart
In the previous papers [7101 we defined and explored a formal methodological framework on the basis of which resolution proof systems for stronglyfinite logics can be introduced and studied. In the present paper we extend this approach to a wider class of the socalled resolution logics. 1
Resolution Proofs of Generalized Pigeonhole Principles
, 1988
"... We extend results of A. Haken to give an exponential lower bound on the size of resolution proofs for propositional formulas encoding a generalized pigeonhole principle. These propositional formulas express the fact that there is no oneone mapping from c n objects to n objects when c > 1 ..."
Abstract

Cited by 47 (4 self)
 Add to MetaCart
We extend results of A. Haken to give an exponential lower bound on the size of resolution proofs for propositional formulas encoding a generalized pigeonhole principle. These propositional formulas express the fact that there is no oneone mapping from c n objects to n objects when c > 1
Extended resolution proofs for conjoining BDDs
 IN: PROC. OF THE 1ST INTL. COMPUTER SCIENCE SYMP. IN RUSSIA (CSR 2006). LNCS 3967
, 2006
"... We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applications and our results allow the use of BDDs instead—or in combination with—established proof generation techniques, ba ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applications and our results allow the use of BDDs instead—or in combination with—established proof generation techniques
On Resolution Proofs for Combinational Equivalence Checking
"... Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to produce a proof of equivalence when it proves a miter unsatisfiable. If the CEC engine formulates the problem as a single S ..."
Abstract
 Add to MetaCart
SAT problem (call this naïve), one can use the resolution proof of unsatisfiability as a proof of equivalence. However, a modern CEC engine does not directly invoke a SAT solver for the whole miter, but instead uses a variety of techniques such as structural hashing, detection of intermediate
On Resolution Proofs for Combinational Equivalence ABSTRACT
"... Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to produce a proof of equivalence when it proves a miter unsatisfiable. If the CEC engine formulates the problem as a single S ..."
Abstract
 Add to MetaCart
SAT instance (call this naïve), one can use the resolution proof of unsatisfiability as a proof of equivalence. However, a modern CEC engine does not directly invoke a SAT solver for the whole miter, but instead uses a variety of techniques such as structural hashing, detection of intermediate
Lineartime reductions of resolution proofs
 HVC ’08: 4th Intl. Haifa Verification Conf. on Hardware and Software, volume 5394 of Lecture Notes in Computer Science
, 2009
"... Abstract. DPLLbased SAT solvers progress by implicitly applying binary resolution. The resolution proofs that they generate are used, after the SAT solver’s run has terminated, for various purposes. Most notable uses in formal verification are: extracting an unsatisfiable core, extracting an inter ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. DPLLbased SAT solvers progress by implicitly applying binary resolution. The resolution proofs that they generate are used, after the SAT solver’s run has terminated, for various purposes. Most notable uses in formal verification are: extracting an unsatisfiable core, extracting
Tree resolution proofs of the weak pigeonhole principle
 In Annual Conference on Structure in Complexity Theory
, 2001
"... We prove that any optimal tree resolution ¥§¦¨¥§© proof � of is of ��� size, independently � from, � � even if it is infinity. So far, ��� only a lower bound has been known, in the general case. We also show that any, not necessarily optimal, regular tree resolution proof ¥§¦¨¥§© is ��� bounded by ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We prove that any optimal tree resolution ¥§¦¨¥§© proof � of is of ��� size, independently � from, � � even if it is infinity. So far, ��� only a lower bound has been known, in the general case. We also show that any, not necessarily optimal, regular tree resolution proof ¥§¦¨¥§© is ��� bounded
Natural Style for Resolution Proofs in Theorema
"... The proofs generated by clausa reasoners are often too long and hard to follow by the user (even if experienced), because most of the structure of the initial problem is not expressed by the clausal formula. For this reason, it is very important, especially for practical applications, to express the ..."
Abstract
 Add to MetaCart
the proofs in a more natural style. This paper analyzes the method suggested by [Meier], namely to perform the transformation on the proofs obtained by resolution at the assertion level. More precise, the emphasis was on integrating the algorithms suggested by [Meier] in the Theorema system which
a Metric for Propositional Resolution Proofs?
"... 1 Introduction The reader is assumed to be generally familiar with the propositional satisfiability problem, CNF formulas, and resolution derivations. Some definitions are briefly reviewed in Section 2, but are not comprehensive. ..."
Abstract
 Add to MetaCart
1 Introduction The reader is assumed to be generally familiar with the propositional satisfiability problem, CNF formulas, and resolution derivations. Some definitions are briefly reviewed in Section 2, but are not comprehensive.
a Metric for Propositional Resolution Proofs
"... 1 Introduction BenSasson and Wigderson showed that, if the minimumlength general resolution refutation for a CNF formula F has S steps, and if the minimumlength treelike refutation of F has ST steps, then there is a (possibly different) refutation of F using clauses of width at most: ..."
Abstract
 Add to MetaCart
1 Introduction BenSasson and Wigderson showed that, if the minimumlength general resolution refutation for a CNF formula F has S steps, and if the minimumlength treelike refutation of F has ST steps, then there is a (possibly different) refutation of F using clauses of width at most:
Results 1  10
of
261,873