Artificial Intelligence, constraint satisfaction problems

Local search, random SAT, artificial intelligence

(probabilistic analysis of algorithms, polynomial time solvable subclasses of satisfiability)

Recent paper on the hardness of random formulas for SAT solver; bounded tree-width

SAT-based hardware verification (using Stalmarck's algorithm)