Finite Model Generation, Proof-Producing SAT Solvers, and SMT

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

• Tjark Weber (University of Cambridge)
• Tuesday 03 February 2009, 13:00-14:00
• Computer Laboratory, William Gates Building, Room SS03.

If you have a question about this talk, please contact Thomas Tuerk.

This talk consists of three parts. First, I will present a finite model generator for higher-order logic. The input formula is translated to propositional logic, so that a standard SAT solver can be employed for the actual model search. The model generator supports many of the definitional mechanisms available in the Isabelle/HOL theorem prover, and has been applied to various case studies.

Second, I will present an integration of proof-producing SAT solvers with higher-order logic theorem provers. An adequate representation of the SAT problem allows to verify unsatisfiability proofs with millions of resolutions steps.

Last, I will give a brief introduction to Satisfiability Modulo Theories (SMT), the decision problem for first-order formulae with respect to combinations of background theories.

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)
• Cambridge talks
• Computer Laboratory Automated Reasoning Group Lunches
• Computer Laboratory, William Gates Building, Room SS03
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.