default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid G. Mitchell
Person information
- affiliation: Simon Fraser University, Burnaby, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c20]Bart Bogaerts, Eugenia Ternovska, David G. Mitchell:
Propagators and Solvers for the Algebra of Modular Systems. LPAR 2017: 227-248- 2016
- [i4]Bart Bogaerts, Eugenia Ternovska, David G. Mitchell:
Propagators and Solvers for the Algebra of Modular Systems. CoRR abs/1606.08130 (2016) - 2015
- [c19]David G. Mitchell, Eugenia Ternovska:
Clause-Learning for Modular Systems. LPNMR 2015: 446-452 - 2013
- [j6]Amir Aavani, Eugenia Ternovska, David G. Mitchell:
Problem Solving with the Enfragmo System. Theory Pract. Log. Program. 13(4-5-Online-Supplement) (2013) - [c18]Amir Aavani, David G. Mitchell, Eugenia Ternovska:
New Encoding for Translating Pseudo-Boolean Constraints into SAT. SARA 2013 - 2012
- [c17]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: 15-22 - 2011
- [c16]Amir Aavani, Xiongnan (Newman) Wu, Eugenia Ternovska, David G. Mitchell:
Grounding Formulas with Complex Terms. Canadian AI 2011: 13-25 - [i3]Pashootan Vaezipoor, David G. Mitchell, Maarten Mariën:
Lifted Unit Propagation for Effective Grounding. CoRR abs/1109.1317 (2011) - 2010
- [c15]Amir Aavani, Shahab Tasharrofi, Gulay Ünel, Eugenia Ternovska, David G. Mitchell:
Speed-Up Techniques for Negation in Grounding. LPAR (Dakar) 2010: 13-26 - [c14]Antonina Kolokolova, Yongmei Liu, David G. Mitchell, Eugenia Ternovska:
On the Complexity of Model Expansion. LPAR (Yogyakarta) 2010: 447-458
2000 – 2009
- 2009
- [c13]Eugenia Ternovska, David G. Mitchell:
Declarative Programming of Search Problems with Built-in Arithmetic. IJCAI 2009: 942-947 - 2008
- [j5]David G. Mitchell, Eugenia Ternovska:
Expressive power and abstraction in Essence. Constraints An Int. J. 13(3): 343-384 (2008) - 2007
- [c12]David G. Mitchell, Faraz Hach, Raheleh Mohebali:
Faster Phylogenetic Inference with MXG. LPAR 2007: 423-437 - [c11]Joshua Buresh-Oppenheim, David G. Mitchell:
Minimum 2CNF Resolution Refutations in Polynomial Time. SAT 2007: 300-313 - 2006
- [c10]Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta:
Constructing Camin-Sokal Phylogenies Via Answer Set Programming. LPAR 2006: 452-466 - [c9]Joshua Buresh-Oppenheim, David G. Mitchell:
Minimum Witnesses for Unsatisfiable 2CNFs. SAT 2006: 42-47 - 2005
- [j4]Paul Beame
, Joseph C. Culberson, David G. Mitchell, Cristopher Moore:
The resolution complexity of random graph k-colorability. Discret. Appl. Math. 153(1-3): 25-47 (2005) - [j3]David G. Mitchell:
A SAT Solver Primer. Bull. EATCS 85: 112-132 (2005) - [c8]David G. Mitchell, Eugenia Ternovska:
A Framework for Representing and Solving NP Search Problems. AAAI 2005: 430-435 - [c7]Joey Hwang, David G. Mitchell:
2-Way vs. d-Way Branching for CSP. CP 2005: 343-357 - [e1]Holger H. Hoos, David G. Mitchell:
Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3542, Springer 2005, ISBN 3-540-27829-X [contents] - 2004
- [i2]Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore:
The Resolution Complexity of Random Graph k-Colorability. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c6]David G. Mitchell:
Resolution and Constraint Satisfaction. CP 2003: 555-569 - 2002
- [b1]David G. Mitchell:
The resolution complexity of constraint satisfaction. University of Toronto, Canada, 2002 - [c5]David G. Mitchell:
Resolution Complexity of Random Constraints. CP 2002: 295-309 - 2001
- [i1]Josh Buresh-Oppenheim, David G. Mitchell, Toniann Pitassi:
Linear and Negative Resolution are Weaker than Resolution. Electron. Colloquium Comput. Complex. TR01 (2001)
1990 – 1999
- 1998
- [c4]David G. Mitchell:
Hard Problems for CSP Algorithms. AAAI/IAAI 1998: 398-405 - 1996
- [j2]Bart Selman, David G. Mitchell, Hector J. Levesque:
Generating Hard Satisfiability Problems. Artif. Intell. 81(1-2): 17-29 (1996) - [j1]David G. Mitchell, Hector J. Levesque:
Some Pitfalls for Experimenters with Random SAT. Artif. Intell. 81(1-2): 111-125 (1996) - [c3]Stephen A. Cook, David G. Mitchell:
Finding hard instances of the satisfiability problem: A survey. Satisfiability Problem: Theory and Applications 1996: 1-17 - 1992
- [c2]Bart Selman, Hector J. Levesque, David G. Mitchell:
A New Method for Solving Hard Satisfiability Problems. AAAI 1992: 440-446 - [c1]David G. Mitchell, Bart Selman, Hector J. Levesque:
Hard and Easy Distributions of SAT Problems. AAAI 1992: 459-465
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
