• Publications
  • Influence
A New Method for Solving Hard Satisfiability Problems
tl;dr
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Expand
  • 1,476
  • 152
  • Open Access
Noise Strategies for Improving Local Search
tl;dr
We show that mixed random walk improves upon the best known methods for solving MAX-SAT and circuit synthesis and circuit diagnosis problems. Expand
  • 904
  • 106
  • Open Access
Hard and Easy Distributions of SAT Problems
tl;dr
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 satisfiability testing is quite difficult. Expand
  • 972
  • 79
Pushing the Envelope: Planning, Propositional Logic and Stochastic Search
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 algorithmExpand
  • 998
  • 67
  • Open Access
Local search strategies for satisfiability testing
tl;dr
We introduce a new strategy, called mixed random walk, for escaping from local minima that allows us to handle formulas that are substantially larger than those that can be solved with basic local search. Expand
  • 686
  • 67
  • Open Access
Planning as Satisfiability
tl;dr
SATPLAN04 is a updated version of the planning as satisfiability approach originally proposed in (Kautz & Selman 1992; 1996) using hand-generated translations, and implemented for PDDL input in the blackbox system. Expand
  • 1,058
  • 63
  • Open Access
Unstructured human activity detection from RGBD images
tl;dr
We perform detection and recognition of human activity in unstructured environments using a hierarchical maximum entropy Markov model based on a two-layered graph structure. Expand
  • 476
  • 61
  • Open Access
Evidence for Invariants in Local Search
tl;dr
This paper presents empirical evidence that such useful invariants (i.e.,properties that hold across strategies and domains) do indeed exist. Expand
  • 438
  • 53
  • Open Access
Unifying SAT-based and Graph-based Planning
tl;dr
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). Expand
  • 536
  • 52
  • Open Access
Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems
tl;dr
We present three strategies that dramatically improve GSAT's performance on handcrafted encodings of blocks-world planning problems and formulas with a high degree of asymmetry. Expand
  • 389
  • 38
  • Open Access