David G. Mitchell

According to our database, David G. Mitchell authored at least 30 papers between 1992 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

Propagators and Solvers for the Algebra of Modular Systems.

Bart Bogaerts, Eugenia Ternovska, David G. Mitchell

Proceedings of the LPAR-21, 2017

2015

Clause-Learning for Modular Systems.

David G. Mitchell, Eugenia Ternovska

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2015

2013

Problem Solving with the Enfragmo System.

Amir Aavani, Eugenia Ternovska, David G. Mitchell

Theory Pract. Log. Program., 2013

New Encoding for Translating Pseudo-Boolean Constraints into SAT.

Amir Aavani, David G. Mitchell, Eugenia Ternovska

Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

2012

Enfragmo: A System for Modelling and Solving Search Problems with Logic.

Amir Aavani, Xiongnan (Newman) Wu, Shahab Tasharrofi, Eugenia Ternovska, David G. Mitchell

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

2011

Lifted Unit Propagation for Effective Grounding

Pashootan Vaezipoor, David G. Mitchell, Maarten Mariën

CoRR, 2011

Grounding Formulas with Complex Terms.

Amir Aavani, Xiongnan (Newman) Wu, Eugenia Ternovska, David G. Mitchell

Proceedings of the Advances in Artificial Intelligence, 2011

2010

On the Complexity of Model Expansion.

Antonina Kolokolova, Yongmei Liu, David G. Mitchell, Eugenia Ternovska

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Speed-Up Techniques for Negation in Grounding.

Amir Aavani, Shahab Tasharrofi, Gulay Ünel, Eugenia Ternovska, David G. Mitchell

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009

Declarative Programming of Search Problems with Built-in Arithmetic.

Eugenia Ternovska, David G. Mitchell

Proceedings of the IJCAI 2009, 2009

2008

Expressive power and abstraction in Essence.

David G. Mitchell, Eugenia Ternovska

Constraints An Int. J., 2008

2007

Minimum 2CNF Resolution Refutations in Polynomial Time.

Joshua Buresh-Oppenheim, David G. Mitchell

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Faster Phylogenetic Inference with MXG.

David G. Mitchell, Faraz Hach, Raheleh Mohebali

Proceedings of the Logic for Programming, 2007

2006

Minimum Witnesses for Unsatisfiable 2CNFs.

Joshua Buresh-Oppenheim, David G. Mitchell

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Constructing Camin-Sokal Phylogenies Via Answer Set Programming.

Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta

Proceedings of the Logic for Programming, 2006

2005

A SAT Solver Primer.

David G. Mitchell

Bull. EATCS, 2005

The resolution complexity of random graph <i>k</i>-colorability.

Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore

Discret. Appl. Math., 2005

2-Way vs. d-Way Branching for CSP.

Joey Hwang, David G. Mitchell

Proceedings of the Principles and Practice of Constraint Programming, 2005

A Framework for Representing and Solving NP Search Problems.

David G. Mitchell, Eugenia Ternovska

Proceedings of the Proceedings, 2005

2004

The Resolution Complexity of Random Graph k-Colorability

Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore

Electron. Colloquium Comput. Complex., 2004

2003

Resolution and Constraint Satisfaction.

David G. Mitchell

Proceedings of the Principles and Practice of Constraint Programming, 2003

2002

The resolution complexity of constraint satisfaction.

David G. Mitchell

PhD thesis, 2002

Resolution Complexity of Random Constraints.

David G. Mitchell

Proceedings of the Principles and Practice of Constraint Programming, 2002

2001

Linear and Negative Resolution are Weaker than Resolution

Josh Buresh-Oppenheim, David G. Mitchell, Toniann Pitassi

Electron. Colloquium Comput. Complex., 2001

1998

Hard Problems for CSP Algorithms.

David G. Mitchell

Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1996

Generating Hard Satisfiability Problems.

Bart Selman, David G. Mitchell, Hector J. Levesque

Artif. Intell., 1996

Some Pitfalls for Experimenters with Random SAT.

David G. Mitchell, Hector J. Levesque

Artif. Intell., 1996

Finding hard instances of the satisfiability problem: A survey.

Stephen A. Cook, David G. Mitchell

Proceedings of the Satisfiability Problem: Theory and Applications, 1996

1992

A New Method for Solving Hard Satisfiability Problems.

Bart Selman, Hector J. Levesque, David G. Mitchell

Proceedings of the 10th National Conference on Artificial Intelligence, 1992

Hard and Easy Distributions of SAT Problems.

David G. Mitchell, Bart Selman, Hector J. Levesque

Proceedings of the 10th National Conference on Artificial Intelligence, 1992