2020 05 21 CL9 Efficient SMT solving - SMT for combinations of theories
Channel: Creative Commons
Date: 2022-04-30

Efficient SMT solving :
*Combining SAT with Theory Solvers
*Theory Solvers for theories of interest
*SMT for combinations of theories
-------------------------------
The registrations of the classes of the course
"SAT & SMT 2020".
----------------- 
Propositional Satisfiability (SAT) and Satisfiability Modulo Theories
(SMT) are of much interest in many domains, ranging from :
*(SAT) Theoretical interest, as main NP-complete problem
*SAT solvers and, more recently, SMT solvers, are increasingly used
as backend engines in a variety of applications
This course provides an introduction to SAT and SMT.
Fields of interest:
automated reasoning, algorithms and combinatorics, artificial
intelligence, bioinformatics, constraint programming, electronics,
knowledge representation, formal verification of SW and HW,
optimization, security,...
-------------