This course and the corresponding graduate course was centered on the problem of modularly organizing SAT and CSP solvers. We discovered Some useful links Teaching

 

Teaching
Research
Papers
Presentations
NU PRL
About me
Old home page

A Short History: I started my research career in computer science as a theoretical computer scientist, focusing on the theory of P-optimal algorithms for the Satisfiability problem, still an active area of research. I also invented non-chronological backtracking based on learned clauses (superresolution) which has become a key feature of most state-of-the-art SAT and CSP solvers.