Compression of propositional resolution proofs by lowering subproofs

DOI10.1007/978-3-642-40537-2_7MaRDI QIDQ2851933zbMATH OpenOpenAlexFDO

Authors Joseph Boudou

Publication date 4 October 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40537-2_7

Mathematics Subject Classification ID

Recommendations

• Towards the compression of first-order resolution proofs by lowering unit clauses
• Compression of propositional resolution proofs via partial regularization
• Compressing propositional refutations
• Data compression for proof replay
• Resolution proof transformation for compression and interpolation

Cited in

(11)

• Data compression for proof replay
• Parallelizing SMT solving: lazy decomposition and conciliation
• Implementation and evaluation of contextual natural deduction for minimal logic
• Towards the compression of first-order resolution proofs by lowering unit clauses
• A Compressing Translation from Propositional Resolution to Natural Deduction
• scientific article; zbMATH DE number 1552526 (Why is no real title available?)
• Improved single pass algorithms for resolution proof reduction
• Resolution proof transformation for compression and interpolation
• Lifting propositional proof compression algorithms to first-order logic
• Compressing propositional refutations
• Compression of propositional resolution proofs via partial regularization

Describes a project that uses

Uses Software

• veriT

This page was built for publication: Compression of propositional resolution proofs by lowering subproofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851933)