Hard and Easy Distributions of SAT Problems. - David G. Mitchell; Bart Selman; Hector J. Levesque (AAAI, 1992)

A New Method for Solving Hard Satisfiability Problems. - Bart Selman; Hector J. Levesque; David G. Mitchell (AAAI, 1992)

Finding hard instances of the satisfiability problem: A survey. - Stephen A. Cook; David G. Mitchell (Satisfiability Problem: Theory and Applications, 1996)

Some Pitfalls for Experimenters with Random SAT. - David G. Mitchell; Hector J. Levesque (Artif. Intell., 1996)

Generating Hard Satisfiability Problems. - Bart Selman; David G. Mitchell; Hector J. Levesque (Artif. Intell., 1996)

Hard Problems for CSP Algorithms. - David G. Mitchell (AAAI/IAAI, 1998)

Linear and Negative Resolution are Weaker than Resolution - Josh Buresh-Oppenheim; David G. Mitchell; Toniann Pitassi (Electron. Colloquium Comput. Complex., 2001)

Resolution Complexity of Random Constraints. - David G. Mitchell (CP, 2002)

The resolution complexity of constraint satisfaction. - David G. Mitchell (2002)

Resolution and Constraint Satisfaction. - David G. Mitchell (CP, 2003)

The Resolution Complexity of Random Graph k-Colorability - Paul Beame; Joseph C. Culberson; David G. Mitchell; Cristopher Moore (Electron. Colloquium Comput. Complex., 2004)

A Framework for Representing and Solving NP Search Problems. - David G. Mitchell; Eugenia Ternovska (AAAI, 2005)

2-Way vs. d-Way Branching for CSP. - Joey Hwang; David G. Mitchell (CP, 2005)

The resolution complexity of random graph k-colorability. - Paul Beame; Joseph C. Culberson; David G. Mitchell; Cristopher Moore (Discret. Appl. Math., 2005)

A SAT Solver Primer. - David G. Mitchell (Bull. EATCS, 2005)

Constructing Camin-Sokal Phylogenies Via Answer Set Programming. - Jonathan Kavanagh; David G. Mitchell; Eugenia Ternovska; Ján Manuch; Xiaohong Zhao; Arvind Gupta (LPAR, 2006)

Minimum Witnesses for Unsatisfiable 2CNFs. - Joshua Buresh-Oppenheim; David G. Mitchell (SAT, 2006)

Faster Phylogenetic Inference with MXG. - David G. Mitchell; Faraz Hach; Raheleh Mohebali (LPAR, 2007)

Minimum 2CNF Resolution Refutations in Polynomial Time. - Joshua Buresh-Oppenheim; David G. Mitchell (SAT, 2007)

Expressive power and abstraction in Essence. - David G. Mitchell; Eugenia Ternovska (Constraints An Int. J., 2008)

Declarative Programming of Search Problems with Built-in Arithmetic. - Eugenia Ternovska; David G. Mitchell (IJCAI, 2009)

Speed-Up Techniques for Negation in Grounding. - Amir Aavani; Shahab Tasharrofi; Gulay Ünel; Eugenia Ternovska; David G. Mitchell (LPAR (Dakar), 2010)

On the Complexity of Model Expansion. - Antonina Kolokolova; Yongmei Liu 001; David G. Mitchell; Eugenia Ternovska (LPAR (Yogyakarta), 2010)

Grounding Formulas with Complex Terms. - Amir Aavani; Xiongnan (Newman) Wu; Eugenia Ternovska; David G. Mitchell (Canadian AI, 2011)

Lifted Unit Propagation for Effective Grounding - Pashootan Vaezipoor; David G. Mitchell; Maarten Mariën (CoRR, 2011)

Enfragmo: A System for Modelling and Solving Search Problems with Logic. - Amir Aavani; Xiongnan (Newman) Wu; Shahab Tasharrofi; Eugenia Ternovska; David G. Mitchell (LPAR, 2012)

New Encoding for Translating Pseudo-Boolean Constraints into SAT. - Amir Aavani; David G. Mitchell; Eugenia Ternovska (SARA, 2013)

Problem Solving with the Enfragmo System. - Amir Aavani; Eugenia Ternovska; David G. Mitchell (Theory Pract. Log. Program., 2013)

Clause-Learning for Modular Systems. - David G. Mitchell; Eugenia Ternovska (LPNMR, 2015)

Propagators and Solvers for the Algebra of Modular Systems. - Bart Bogaerts 001; Eugenia Ternovska; David G. Mitchell (LPAR, 2017)