Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ENTCS
2007

favoriteEmaildiscussreport

101views more ENTCS 2007»

Compressing Propositional Refutations

13 years 4 months ago

Compressing Propositional Refutations

Download www.cl.cam.ac.uk

We report initial results on shortening propositional resolution refutation proofs. This has an application in speeding up deductive reconstruction (in theorem provers) of large propositional refutations, such as those produced by SAT-solvers. Key words: Proof veriﬁcation, Propositional refutations

Hasan Amjad

Real-time Traffic

ENTCS 2007 | Large Propositional Refutations | Propositional Refutations | Propositional Resolution Refutation |

claim paper

Related Content

» The Limits of Tractability in ResolutionBased Propositional Proof Systems

» Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle

» The Completeness of Propositional Resolution A Simple and Constructive Proof

» Complexity Analysis of Propositional Resolution with Autarky Pruning

» Proof Systems for Effectively Propositional Logic

» Deciding Intuitionistic Propositional Logic via Translation into Classical Logic

» A combinatorial characterization of resolution width

» Complexity of Propositional Proofs Under a Promise

» MeanPayoff Games and Propositional Proofs

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	ENTCS
Authors	Hasan Amjad

Comments (0)