|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 listsSt Johns Women Society UK~IRC Summit Modelling in Diabetes
Other talksInnovative Human-Centred Development Approaches: Learn How the UN is Engaging Youth in Peace Building and Development. Socio-Critical Reflections on the Role of the Arts in Youth Custody The colonial hajj from India and Malaya CISA seminar on "UN peacekeeping reform from the operational perspective" Random walk on the random graph 'Harnessing hypoxia signalling in cancer'