Jacob Howe, City University, London
Abstract: This talk will recap how a watched literal DPLL based SAT solver can be succinctly coded in 20 lines of Prolog. The focus of the talk will be the extension of this solver to an SMT solver which will be discussed with a particular focus on the case where the theory is that of rational-tree constraints, and its application in a reverse engineering problem.
[Note change of time from that previously advertised]
- When: 23rd June 2017 13:00 - 14:00
- Where: Cole 1.33a
- Series: AI Seminar Series
- Format: Seminar