Compression of propositional resolution proofs by lowering subproofs

DOI10.1007/978-3-642-40537-2_7zbMATH Open1401.68274OpenAlexW27140037MaRDI QIDQ2851933FDOQ2851933

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

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

Mathematics Subject Classification ID

Cited In (10)

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

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)