Search the dblp DataBase

Publications of Author

1. Bart Selman, Hector J. Levesque, David G. Mitchell
   A New Method for Solving Hard Satisfiability Problems. [Citation Graph (1, 0)][DBLP]
   AAAI, 1992, pp:440-446 [Conf]
   
2. David G. Mitchell
   Hard Problems for CSP Algorithms. [Citation Graph (0, 0)][DBLP]
   AAAI/IAAI, 1998, pp:398-405 [Conf]
   
3. David G. Mitchell, Bart Selman, Hector J. Levesque
   Hard and Easy Distributions of SAT Problems. [Citation Graph (0, 0)][DBLP]
   AAAI, 1992, pp:459-465 [Conf]
   
4. David G. Mitchell, Eugenia Ternovska
   A Framework for Representing and Solving NP Search Problems. [Citation Graph (0, 0)][DBLP]
   AAAI, 2005, pp:430-435 [Conf]
   
5. Joey Hwang, David G. Mitchell
   2-Way vs. d-Way Branching for CSP. [Citation Graph (0, 0)][DBLP]
   CP, 2005, pp:343-357 [Conf]
   
6. David G. Mitchell
   Resolution Complexity of Random Constraints. [Citation Graph (0, 0)][DBLP]
   CP, 2002, pp:295-309 [Conf]
   
7. David G. Mitchell
   Resolution and Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
   CP, 2003, pp:555-569 [Conf]
   
8. Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta
   Constructing Camin-Sokal Phylogenies Via Answer Set Programming. [Citation Graph (0, 0)][DBLP]
   LPAR, 2006, pp:452-466 [Conf]
   
9. Joshua Buresh-Oppenheim, David G. Mitchell
   Minimum Witnesses for Unsatisfiable 2CNFs. [Citation Graph (0, 0)][DBLP]
   SAT, 2006, pp:42-47 [Conf]
   
10. David G. Mitchell, Hector J. Levesque
    Some Pitfalls for Experimenters with Random SAT. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1996, v:81, n:1-2, pp:111-125 [Journal]
    
11. Bart Selman, David G. Mitchell, Hector J. Levesque
    Generating Hard Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1996, v:81, n:1-2, pp:17-29 [Journal]
    
12. Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore
    The resolution complexity of random graph k-colorability. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:153, n:1-3, pp:25-47 [Journal]
    
13. David G. Mitchell
    A SAT Solver Primer. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2005, v:85, n:, pp:112-132 [Journal]
    
14. Josh Buresh-Oppenheim, David G. Mitchell, Toniann Pitassi
    Linear and Negative Resolution are Weaker than Resolution [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:074, pp:- [Journal]
    
15. Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore
    The Resolution Complexity of Random Graph k-Colorability [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:012, pp:- [Journal]
    
16. David G. Mitchell, Faraz Hach, Raheleh Mohebali
    Faster Phylogenetic Inference with MXG. [Citation Graph (0, 0)][DBLP]
    LPAR, 2007, pp:423-437 [Conf]
    
17. Joshua Buresh-Oppenheim, David G. Mitchell
    Minimum 2CNF Resolution Refutations in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:300-313 [Conf]
    
18. 
    Declarative Programming of Search Problems with Built-in Arithmetic. [Citation Graph (, )][DBLP]
    
    
19. 
    Expressive power and abstraction in Essence. [Citation Graph (, )][DBLP]