|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 listsOne day Meeting (Cambridge Philosophical Society): Synthetic Biology - Molecular Bioengineering for the 21st Century Seminars on Chinese Linguistics and L2 Chinese Vertical Readings in Dante's 'Comedy'
Other talksThe shock to reinvigorate medieval economic history? (De)compaction waves in porous viscoelastoplastic media and focused fluid flow "The Good, the Bad, and the Ugly: Early Jesuit Engagement with the Qur'an." TBC (SP Workshop) POLIS Department Seminar - The Reconfiguration of the State Internal Student talks