#### Filter Results:

- Full text PDF available (209)

#### Publication Year

1975

2017

- This year (2)
- Last 5 years (40)
- Last 10 years (87)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

- Bart Selman, Henry A. Kautz, Bram Cohen
- AAAI
- 1994

It has recently been shown that local search is sur prisingly good at nding satisfying assignments for certain computationally hard classes of CNF formu las The performance of basic local search methods can be further enhanced by introducing mechanisms for escaping from local minima in the search space We will compare three such mechanisms simulated… (More)

- Henry A. Kautz, Bart Selman
- AAAI/IAAI, Vol. 2
- 1996

Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning problems many times faster than the best current planning… (More)

- 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, Henry A. Kautz, Bram Cohen
- Cliques, Coloring, and Satisfiability
- 1993

It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain classes of CNF formulas (Sel-man et al. 1992). In this paper we demonstrate that the power of local search for satissability testing can be further enhanced by employing a new strategy, called \mixed random walk", for escaping from local minima. We… (More)

- Henry A. Kautz, Bart Selman
- IJCAI
- 1999

The Blackbox planning system unifies the planning as satisfiability framework (Kautz and Selman 1992, 1996) with the plan graph approach to STRIPS planning (Blum and Furst 1995). We show that STRIPS problems can be directly translated into SAT and efficiently solved using new randomized systematic solvers. For certain computationally challenging benchmark… (More)

- Henry A. Kautz, Bart Selman
- ECAI
- 1992

- Henry A. Kautz, Bart Selman, Mehul A. Shah
- Commun. ACM
- 1997

Part of the success of social networks can be attributed to the “six degrees of separation’’ phenomena that means the distance between any two individuals in terms of direct personal relationships is relatively small. An equally important factor is there are limits to the amount and kinds of information a person is able or willing to make available to the… (More)

- David A. McAllester, Bart Selman, Henry A. Kautz
- AAAI/IAAI
- 1997

It is well known that the performance of a stochastic local search procedure depends upon the setting of its noise parameter, and that the optimal setting varies with the problem distribution. It is therefore desirable to develop general priniciples for tuning the procedures. We present two statistical measures of the local search process that allow one to… (More)

- Bart Selman, Henry A. Kautz
- IJCAI
- 1993

GSAT is a randomized local search procedure for solving propositional satisfiability problems (Selman et al. 1992). GSAT can solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approaches such as the Davis-Putnam procedure. GSAT also efficiently solves encodings of graph coloring… (More)