Improved single pass algorithms for resolution proof reduction

DOI10.1007/978-3-642-33386-6_10MaRDI QIDQ4649291zbMATH OpenOpenAlexFDO

Authors Ashutosh Gupta

Publication date 21 November 2012

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33386-6_10

Mathematics Subject Classification ID

Recommendations

• An efficient and flexible approach to resolution proof reduction
• Two techniques for minimizing resolution proofs
• Compression of propositional resolution proofs via partial regularization
• Compression of propositional resolution proofs by lowering subproofs
• Resolution proof transformation for compression and interpolation

Cited in

(6)

• Resolution proof transformation for compression and interpolation
• Two techniques for minimizing resolution proofs
• Compression of propositional resolution proofs via partial regularization
• An efficient and flexible approach to resolution proof reduction
• Proof optimization for partial redundancy elimination
• Optimization techniques for Craig interpolant compaction in unbounded model checking

Describes a project that uses

Uses Software

• FOCI
• OpenSMT
• MUP
• AMUSE

This page was built for publication: Improved single pass algorithms for resolution proof reduction

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