Solving HOL problems using FOL tools

Add to your list(s) Download to your calendar using vCal

• Nik Sultana (University of Cambridge)
• Tuesday 02 June 2009, 13:00-14:00
• Computer Laboratory, William Gates Building, Room SS03.

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:

• All Talks (aka the CURE list)
• Computer Laboratory Automated Reasoning Group Lunches
• Computer Laboratory talks
• Computer Laboratory, William Gates Building, Room SS03
• School of Technology

Note that ex-directory lists are not shown.