A New Method for Solving Hard Satisfiability Problems
- B. Selman, H. Levesque, D. Mitchell
- Computer ScienceAAAI Conference on Artificial Intelligence
- 12 July 1992
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
- D. Mitchell, B. Selman, H. Levesque
- Computer ScienceAAAI Conference on Artificial Intelligence
- 12 July 1992
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
- B. Selman, D. Mitchell, H. Levesque
- Computer ScienceArtificial Intelligence
- 1 March 1996
Finding hard instances of the satisfiability problem: A survey
- S. Cook, D. Mitchell
- Computer ScienceSatisfiability Problem: Theory and Applications
- 1996
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
- D. Mitchell, E. Ternovska
- Computer ScienceAAAI Conference on Artificial Intelligence
- 9 July 2005
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.
Theory and Applications of Satisfiability Testing
- H. Hoos, D. Mitchell
- Computer Science
- 2008
Resolution Complexity of Random Constraints
- D. Mitchell
- Computer Science, MathematicsInternational Conference on Principles and…
- 9 September 2002
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
- Pashootan Vaezipoor, D. Mitchell, M. Mariën
- Computer ScienceArXiv
- 6 September 2011
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.
Generating Hard Satis ability Problems ?
- B. Selman, D. Mitchell, H. Levesque
- Computer Science
- 1995
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 satissability testing is quite diicult.
The resolution complexity of constraint satisfaction
- D. Mitchell
- Computer Science
- 2002
The results generalize those implied via random k-SAT in two respects: they apply to binary CSPs, and they hold for constraints which are “tighter” than propositional clauses.
...
...