|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 listsMethodology in design research Institute for Manufacturing Workshops/Conferences European Bioinformatics Institute
Other talksMutational and Functional analysis of melanoma: filling in the gap CPP Seminar: Human Development and Decent Work: Comparing a policy success with a policy failure Special numbers and special functions related to Ramanujan's mock modular forms The computational complexity of entanglement detection Rethinking the European Union CGHR Expert Practitioner Series: Working in Human Rights, Peacebuilding, Humanitarian Aid and Development