Sciweavers

10 search results - page 1 / 2
» Canonical Disjoint NP-Pairs of Propositional Proof Systems
Sort
View
MFCS
2005
Springer
13 years 10 months ago
Canonical Disjoint NP-Pairs of Propositional Proof Systems
We prove that every disjoint NP-pair is polynomial-time, many-one equivalent to the canonical disjoint NP-pair of some propositional proof system. Therefore, the degree structure ...
Christian Glaßer, Alan L. Selman, Liyu Zhang
COCOON
2007
Springer
13 years 11 months ago
The Informational Content of Canonical Disjoint NP-Pairs
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between the...
Christian Glaßer, Alan L. Selman, Liyu Zhang
BIRTHDAY
2006
Springer
13 years 8 months ago
Survey of Disjoint NP-pairs and Relations to Propositional Proof Systems
Christian Glaßer, Alan L. Selman, Liyu Zhang
ECCC
2006
93views more  ECCC 2006»
13 years 4 months ago
On the Deduction Theorem and Complete Disjoint NP-Pairs
In this paper we ask the question whether the extended Frege proof system EF satisfies a weak version of the deduction theorem. We prove that if this is the case, then complete dis...
Olaf Beyersdorff
ENTCS
2006
113views more  ENTCS 2006»
13 years 4 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump