University of Cambridge > Talks.cam > Computer Laboratory Automated Reasoning Group Lunches > A Compressing Translation from Propositional Resolution to Natural Deduction

A Compressing Translation from Propositional Resolution to Natural Deduction

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Thomas Tuerk.

I’ll talk about caching identical parts of a SAT solver generated propositional resolution refutation proof in such a way that the resulting smaller proof can be replayed in LCF -style natural deduction provers. The method can handle proofs with millions of inferences and proof is faster than with current methods.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity