![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tuesday 29 May 2007, 13:00-14:00
A Compressing Translation from Propositional Resolution to Natural Deduction
- đ¤ Speaker: Hasan Amjad (University of Cambridge)
- đ Date & Time: Tuesday 29 May 2007, 13:00 - 14:00
- đ Venue: Computer Laboratory, William Gates Building, Room GS15
Questions? Contact
Thomas Tuerk
Abstract
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.
Series This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory Automated Reasoning Group Lunches
- Computer Laboratory, William Gates Building, Room GS15
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Martin's interesting talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.