David G. Mitchell

Publication Activity (10 Years)

Years Active: 1992-2017
Publications (10 Years): 2

Top Topics

Search Problems

Human Problem Solving

Top Venues

Theory Pract. Log. Program.

Publications

Bart Bogaerts, Eugenia Ternovska, David G. Mitchell
Propagators and Solvers for the Algebra of Modular Systems. LPAR (2017)
Bart Bogaerts, Eugenia Ternovska, David G. Mitchell
Propagators and Solvers for the Algebra of Modular Systems. CoRR (2016)
David G. Mitchell, Eugenia Ternovska
Clause-Learning for Modular Systems. LPNMR (2015)
Amir Aavani, Eugenia Ternovska, David G. Mitchell
Problem Solving with the Enfragmo System. Theory Pract. Log. Program. 13 (4-5-Online-Supplement) (2013)
Amir Aavani, David G. Mitchell, Eugenia Ternovska
New Encoding for Translating Pseudo-Boolean Constraints into SAT. SARA (2013)
Amir Aavani, Xiongnan (Newman) Wu, Shahab Tasharrofi, Eugenia Ternovska, David G. Mitchell
Enfragmo: A System for Modelling and Solving Search Problems with Logic. LPAR (2012)
Pashootan Vaezipoor, David G. Mitchell, Maarten Mariën
Lifted Unit Propagation for Effective Grounding CoRR (2011)
Amir Aavani, Xiongnan (Newman) Wu, Eugenia Ternovska, David G. Mitchell
Grounding Formulas with Complex Terms. Canadian Conference on AI (2011)
Amir Aavani, Shahab Tasharrofi, Gulay Ünel, Eugenia Ternovska, David G. Mitchell
Speed-Up Techniques for Negation in Grounding. LPAR (Dakar) (2010)
Antonina Kolokolova, Yongmei Liu, David G. Mitchell, Eugenia Ternovska
On the Complexity of Model Expansion. LPAR (Yogyakarta) (2010)
Eugenia Ternovska, David G. Mitchell
Declarative Programming of Search Problems with Built-in Arithmetic. IJCAI (2009)
David G. Mitchell, Eugenia Ternovska
Expressive power and abstraction in Essence. Constraints An Int. J. 13 (3) (2008)
David G. Mitchell, Faraz Hach, Raheleh Mohebali
Faster Phylogenetic Inference with MXG. LPAR (2007)
Joshua Buresh-Oppenheim, David G. Mitchell
Minimum 2CNF Resolution Refutations in Polynomial Time. SAT (2007)
Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta
Constructing Camin-Sokal Phylogenies Via Answer Set Programming. LPAR (2006)
Joshua Buresh-Oppenheim, David G. Mitchell
Minimum Witnesses for Unsatisfiable 2CNFs. SAT (2006)
David G. Mitchell
A SAT Solver Primer. Bull. EATCS 85 (2005)
Joey Hwang, David G. Mitchell
2-Way vs. d-Way Branching for CSP. CP (2005)
David G. Mitchell, Eugenia Ternovska
A Framework for Representing and Solving NP Search Problems. AAAI (2005)
Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore
-colorability. Discret. Appl. Math. 153 (1-3) (2005)
Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore
The Resolution Complexity of Random Graph k-Colorability Electron. Colloquium Comput. Complex. (012) (2004)
David G. Mitchell
Resolution and Constraint Satisfaction. CP (2003)
David G. Mitchell
Resolution Complexity of Random Constraints. CP (2002)
Josh Buresh-Oppenheim, David G. Mitchell, Toniann Pitassi
Linear and Negative Resolution are Weaker than Resolution Electron. Colloquium Comput. Complex. 8 (074) (2001)
David G. Mitchell
Hard Problems for CSP Algorithms. AAAI/IAAI (1998)
Bart Selman, David G. Mitchell, Hector J. Levesque
Generating Hard Satisfiability Problems. Artif. Intell. 81 (1-2) (1996)
Stephen A. Cook, David G. Mitchell
Finding hard instances of the satisfiability problem: A survey. Satisfiability Problem: Theory and Applications (1996)
David G. Mitchell, Hector J. Levesque
Some Pitfalls for Experimenters with Random SAT. Artif. Intell. 81 (1-2) (1996)
David G. Mitchell, Bart Selman, Hector J. Levesque
Hard and Easy Distributions of SAT Problems. AAAI (1992)
Bart Selman, Hector J. Levesque, David G. Mitchell
A New Method for Solving Hard Satisfiability Problems. AAAI (1992)