|
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. |