A Compressed Breadth-First Search for Satisfiability. - DoRon B. Motter; Igor L. Markov (ALENEX, 2002)

Overcoming Resolution-Based Lower Bounds for SAT Solvers. - DoRon B. Motter; Igor L. Markov (IWLS, 2002)

Resolution cannot polynomially simulate compressed-BFS. - DoRon B. Motter; Jarrod A. Roy; Igor L. Markov (Ann. Math. Artif. Intell., 2005)