Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
A Proof Procedure Using Connection Graphs
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
IEEE Transactions on Computers
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Extended resolution proofs for symbolic SAT solving with quantification
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
An efficient and flexible approach to resolution proof reduction
HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing
Two techniques for minimizing resolution proofs
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Improved single pass algorithms for resolution proof reduction
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
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.