|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Solving HOL problems using FOL tools
If you have a question about this talk, please contact Thomas Tuerk.
HOL is seen by many as an ideal language for expressing mathematical ideas, but HOL ’s expressivity makes its automation more challenging. One frequently finds that HOL problems are “essentially first-order”—that is, they can be faithfully translated into FOL . Automated reasoning in FOL is quite mature compared to that in HOL . It has been argued that for “essentially first-order” problems it is more sensible to carry out the translation into FOL and solve using high-performance FOL tools, rather than attempt to solve the problem using a HOL prover. During this talk I will describe and compare translations from HOL to FOL .
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 listsLife Sciences & Society EPRG Energy and Environment (E&E) Series Michaelmas 2011 Churchill College Phoenix Society
Other talksAre Haemostasis and Thrombus Formation Regulated by Platelet Subpopulations? (Focus on Nitric Oxide Signalling) Systems Biology of Cancer Articulating the Intrinsic Value of Chemistry Paradise Lost? How the Internet has changed The decolonization of images in contemporary Brazilian picturebooks Researching (with) Social Media reading group