#### Filter Results:

- Full text PDF available (34)

#### Publication Year

1986

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Bart Selman, Hector J. Levesque, David G. Mitchell
- AAAI
- 1992

- David G. Mitchell, Bart Selman, Hector J. Levesque
- AAAI
- 1992

We report results from large-scale experiments in satis-ability testing. As has been observed by others, testing the satissability of random formulas often appears surprisingly easy. Here we show 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… (More)

- Bart Selman, David G. Mitchell, Hector J. Levesque
- Artif. Intell.
- 1996

We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show 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… (More)

- Stephen A. Cook, David G. Mitchell
- Satisfiability Problem: Theory and Applications
- 1996

Finding sets of hard instances of propositional satissability is of interest for understanding the complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we consider the performance of the most popular SAT algorithms on random problems, the theory of average case complexity, the threshold phenomenon, known lower bounds for… (More)

- David G. Mitchell
- Bulletin of the EATCS
- 2005

- David G. Mitchell
- CP
- 2002

- David G. Mitchell, Eugenia Ternovska
- AAAI
- 2005

NP search and decision problems occur widely in AI, and a number of general-purpose methods for solving them have been developed. The dominant approaches include propositional satisfiability (SAT), constraint satisfaction problems (CSP), and answer set programming (ASP). Here, we propose a declarative constraint programming framework which we believe… (More)

- Pashootan Vaezipoor, David G. Mitchell, Maarten Mariën
- ArXiv
- 2011

A grounding of a formula φ over a given finite domain is a ground formula which is equivalent to φ on that domain. Very effective propositional solvers have made grounding-based methods for problem solving increasingly important, however for realistic problem domains and instances, the size of groundings is often problematic. A key technique in ground… (More)

- Joey Hwang, David G. Mitchell
- CP
- 2005

Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, for domain size d. The schemes are not equivalent, but little is known about their relative power. Here we compare them in terms of how efficiently they can refute an unsatisfiable instance with… (More)

- David G. Mitchell
- CP
- 2003