|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
A Compressing Translation from Propositional Resolution to Natural Deduction
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.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsGreece and its History UCL based talks series BCS East Anglia
Other talksThe influence of the Amundsen-Bellingshausen Seas Low on the climate of West Antarctica and its representation in coupled climate model simulations Cambridge Assessment Network: Validity and the value of educational assessments Forced inertial waves in a spherical shell 'Holocaust Anxiety in Philip Roth's Portnoy's Complaint' - Brett Ashley Kaplan “No Respecter Of Persons Or Peoples” Tipping Points in Social, Economic and Biological Systems