Compression of Propositional Resolution Proofs by Lowering Subproofs
From MaRDI portal
Publication:2851933
DOI10.1007/978-3-642-40537-2_7zbMath1401.68274OpenAlexW27140037MaRDI QIDQ2851933
Bruno Woltzenlogel Paleo, 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Towards the Compression of First-Order Resolution Proofs by Lowering Unit Clauses ⋮ Implementation and Evaluation of Contextual Natural Deduction for Minimal Logic ⋮ Resolution proof transformation for compression and interpolation ⋮ Parallelizing SMT solving: lazy decomposition and conciliation
Uses Software
This page was built for publication: Compression of Propositional Resolution Proofs by Lowering Subproofs
