|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 listsFrench Graduate Research Seminar 2008/2009 Cambridge Networks Forum Cancer Research UK Cambridge Institute Imaging Seminars
Other talksInformation-flow tracking for web technologies Exploring the genetic toolkit for pattern formation and diversification in butterfly wings Spectral Sequences Applied to Two Specific Problems in the BRST Cohomology of Supersymmetric Theories in D=4 and D=10 Spacetime dimensions. Rumour Has It: Rumour Adoption in Conflict-Affected Areas Peaceland: Conflict Resolution and the Everyday Politics of International Intervention Biobanking 2016