Search results for "David G. Mitchell"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	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	DBLP DOI BibTeX RDF
1	Amir Aavani, Xiongnan (Newman) Wu, Eugenia Ternovska, David G. Mitchell	Grounding Formulas with Complex Terms.	Canadian Conference on AI	2011	DBLP DOI BibTeX RDF
1	Amir Aavani, Shahab Tasharrofi, Gulay Ünel, Eugenia Ternovska, David G. Mitchell	Speed-Up Techniques for Negation in Grounding.	LPAR (Dakar)	2010	DBLP DOI BibTeX RDF
1	Antonina Kolokolova, Yongmei Liu, David G. Mitchell, Eugenia Ternovska	On the Complexity of Model Expansion.	LPAR (Yogyakarta)	2010	DBLP DOI BibTeX RDF
1	Eugenia Ternovska, David G. Mitchell	Declarative Programming of Search Problems with Built-in Arithmetic.	IJCAI	2009	DBLP BibTeX RDF
1	David G. Mitchell, Eugenia Ternovska	Expressive power and abstraction in Essence.	Constraints	2008	DBLP DOI BibTeX RDF	Essence, Constraint modelling languages, Model expansion, Abstraction, Expressive power, Descriptive complexity
1	David G. Mitchell, Faraz Hach, Raheleh Mohebali	Faster Phylogenetic Inference with MXG.	LPAR	2007	DBLP DOI BibTeX RDF	Model Expansion, Declarative Programming, Phylogeny
1	Joshua Buresh-Oppenheim, David G. Mitchell	Minimum 2CNF Resolution Refutations in Polynomial Time.	SAT	2007	DBLP DOI BibTeX RDF
1	Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta	Constructing Camin-Sokal Phylogenies Via Answer Set Programming.	LPAR	2006	DBLP DOI BibTeX RDF	Camin-Sokal, answer set programming, phylogeny, maximum parsimony
1	Joshua Buresh-Oppenheim, David G. Mitchell	Minimum Witnesses for Unsatisfiable 2CNFs.	SAT	2006	DBLP DOI BibTeX RDF
1	David G. Mitchell	A SAT Solver Primer.	Bulletin of the EATCS	2005	DBLP BibTeX RDF
1	Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore	The resolution complexity of random graph k-colorability.	Discrete Applied Mathematics	2005	DBLP DOI BibTeX RDF
1	Holger H. Hoos, David G. Mitchell (eds.)	Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers	SAT (Selected Papers)	2005	DBLP BibTeX RDF
1	David G. Mitchell, Eugenia Ternovska	A Framework for Representing and Solving NP Search Problems.	AAAI	2005	DBLP BibTeX RDF
1	Joey Hwang, David G. Mitchell	2-Way vs. d-Way Branching for CSP.	CP	2005	DBLP DOI BibTeX RDF
1	Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore	The Resolution Complexity of Random Graph k-Colorability	Electronic Colloquium on Computational Complexity (ECCC)	2004	DBLP BibTeX RDF
1	David G. Mitchell	Resolution and Constraint Satisfaction.	CP	2003	DBLP DOI BibTeX RDF
1	David G. Mitchell	Resolution Complexity of Random Constraints.	CP	2002	DBLP BibTeX RDF
1	Josh Buresh-Oppenheim, David G. Mitchell, Toniann Pitassi	Linear and Negative Resolution are Weaker than Resolution	Electronic Colloquium on Computational Complexity (ECCC)	2001	DBLP BibTeX RDF
1	David G. Mitchell	Hard Problems for CSP Algorithms.	AAAI/IAAI	1998	DBLP BibTeX RDF
1	David G. Mitchell, Hector J. Levesque	Some Pitfalls for Experimenters with Random SAT.	Artif. Intell.	1996	DBLP DOI BibTeX RDF
1	Bart Selman, David G. Mitchell, Hector J. Levesque	Generating Hard Satisfiability Problems.	Artif. Intell.	1996	DBLP DOI BibTeX RDF
1	Bart Selman, Hector J. Levesque, David G. Mitchell	A New Method for Solving Hard Satisfiability Problems.	AAAI	1992	DBLP BibTeX RDF
1	David G. Mitchell, Bart Selman, Hector J. Levesque	Hard and Easy Distributions of SAT Problems.	AAAI	1992	DBLP BibTeX RDF

Publications of "David G. Mitchell" ( http://dblp.L3S.de/Authors/David_G._Mitchell )