D. Mitchell

Publications59
h-index16
Citations3,817
Highly Influential Citations318
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • E. Ternovska
  • 61 Publications • 799 Citations
  • M. Denecker
  • 240 Publications • 4,454 Citations
  • B. Selman
  • 289 Publications • 23,461 Citations
  • T. Pitassi
  • 216 Publications • 11,177 Citations
  • Publications
  • Influence
A New Method for Solving Hard Satisfiability Problems
TLDR
A greedy local search procedure called GSAT is introduced for solving propositional satisfiability problems and its good performance suggests that it may be advantageous to reformulate reasoning tasks that have traditionally been viewed as theorem-proving problems as model-finding tasks.
Hard and Easy Distributions of SAT Problems
TLDR
It is shown that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satisfiability testing is quite difficult.
Generating Hard Satisfiability Problems
TLDR
It is shown that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satisfiability testing is quite difficult.
Finding hard instances of the satisfiability problem: A survey
TLDR
The performance of the most popular SAT algorithms on random problems, the theory of average case complexity, the threshold phenomenon, known lower bounds for certain classes of algorithms, and the problem of generating hard instances with solutions are considered.
A Framework for Representing and Solving NP Search Problems
TLDR
A declarative constraint programming framework is proposed which is based on the classical notion of extension of a structure by new relations, and properties of the formal framework intended to support effective modelling, and prospects for effective solver design.
Resolution Complexity of Random Constraints
  • D. Mitchell
  • Computer Science, Mathematics
    CP
  • 9 September 2002
TLDR
An analysis that shows why deciding satisfiability of instances from some distributions is challenging for current complete methods is presented, and shows that when constraints are not too tight almost all unsatisfiable instances have a structural property which guarantees that unsatisfiability proofs in a certain resolution-like system must be of exponential size.
Lifted Unit Propagation for Effective Grounding
TLDR
A "lifted" version of unit propagation which may be carried out prior to grounding is defined, and integration of the resulting technique into grounding algorithms is described and an experimental study of its performance is described.
2-Way vs. d-Way Branching for CSP
TLDR
A natural branching strategy with which backtracking with 2-way branching finds refutations of these instances in time O(d2n2) is given, and exponential separations between C-RES and NG-RES, as well as between the tree-like and unrestricted versions of each system are shown.
Generating Hard Satis ability Problems ?
We report results from large-scale experiments in satissability testing. As has been observed by others, testing the satissability of random formulas often appears surprisingly easy. Here we show…
The resolution complexity of constraint satisfaction
Constraint satisfaction provides a uniform framework for addressing a variety of combinatorial problems. Propositional proof complexity is the study of the minimum lengths of proofs in propositional…
...
1
2
3
4
5
...