Robin Lohfert

Learn More
Divide-and-conquer is an effective general problem solving strategy, and has been applied to improve to the performance of search procedures. The challenge in applying the strategy is to find an appropriate decomposition of the problem into subproblems. In this paper, a decomposition is presented for n-dimensional propositional satisfiability problems.(More)
  • 1