David G. Mitchell - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Grounding Formulas with Complex TermsAmir Aavani, Xiongnan (Newman) Wu, Eugenia Ternovska, David G. Mitchell. ai 2011: 13-25 [doi]

2010

Speed-Up Techniques for Negation in GroundingAmir Aavani, Shahab Tasharrofi, Gulay Ünel, Eugenia Ternovska, David G. Mitchell. lpar 2010: 13-26 [doi]

On the Complexity of Model ExpansionAntonina Kolokolova, Yongmei Liu, David G. Mitchell, Eugenia Ternovska. lpar 2010: 447-458 [doi]

2009

Declarative Programming of Search Problems with Built-in ArithmeticEugenia Ternovska, David G. Mitchell. IJCAI 2009: 942-947 [doi]

2008

Expressive power and abstraction in EssenceDavid G. Mitchell, Eugenia Ternovska. constraints, 13(3):343-384, 2008. [doi]

2007

Minimum 2CNF Resolution Refutations in Polynomial TimeJoshua Buresh-Oppenheim, David G. Mitchell. sat 2007: 300-313 [doi]

Faster Phylogenetic Inference with MXGDavid G. Mitchell, Faraz Hach, Raheleh Mohebali. lpar 2007: 423-437 [doi]

2006

Minimum Witnesses for Unsatisfiable 2CNFsJoshua Buresh-Oppenheim, David G. Mitchell. sat 2006: 42-47 [doi]

Constructing Camin-Sokal Phylogenies Via Answer Set ProgrammingJonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta. lpar 2006: 452-466 [doi]

2005

The resolution complexity of random graph ::::k::::-colorabilityPaul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore. DAM, 153(1-3):25-47, 2005. [doi]

Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected PapersHolger H. Hoos, David G. Mitchell, editors, Volume 3542 of Lecture Notes in Computer Science, Springer, 2005.

2-Way vs. d-Way Branching for CSPJoey Hwang, David G. Mitchell. cp 2005: 343-357 [doi]

A SAT Solver PrimerDavid G. Mitchell. eatcs, 85:112-132, 2005.

A Framework for Representing and Solving NP Search ProblemsDavid G. Mitchell, Eugenia Ternovska. AAAI 2005: 430-435

2004

The Resolution Complexity of Random Graph k-ColorabilityPaul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore. eccc, (012), 2004. [doi]

2003

Resolution and Constraint SatisfactionDavid G. Mitchell. cp 2003: 555-569 [doi]

2002

Resolution Complexity of Random ConstraintsDavid G. Mitchell. cp 2002: 295-309 [doi]

2001

Linear and Negative Resolution are Weaker than ResolutionJosh Buresh-Oppenheim, David G. Mitchell, Toniann Pitassi. eccc, 8(074), 2001. [doi]

1998

Hard Problems for CSP AlgorithmsDavid G. Mitchell. AAAI 1998: 398-405

1996

Some Pitfalls for Experimenters with Random SATDavid G. Mitchell, Hector J. Levesque. ai, 81(1-2):111-125, 1996. [doi]

Generating Hard Satisfiability ProblemsBart Selman, David G. Mitchell, Hector J. Levesque. ai, 81(1-2):17-29, 1996. [doi]

1992

Hard and Easy Distributions of SAT ProblemsDavid G. Mitchell, Bart Selman, Hector J. Levesque. AAAI 1992: 459-465

A New Method for Solving Hard Satisfiability ProblemsBart Selman, Hector J. Levesque, David G. Mitchell. AAAI 1992: 440-446