sub-SAT: a formulation for relaxed boolean satisfiability with applications in routing

Advances in methods for solving Boolean satisfiability (SAT) for large problems have motivated recent attempts to recast physical de-sign problems as Boolean SAT problems. One persistent criticism of these approaches is their inability to supply partial solutions, i.e, to satisfy most but not all of the constraints cast in the SAT style. In this paper we present a formulation for “subset satisfiable ” Boolean SAT: we transform a “strict ” SAT problem with N constraints into a new, “relaxed ” SAT problem which is satisfiable just if not more than k<<N of these constraints cannot be satisfied in the original problem. We describe a transformation based on explicit thresholding and counting for the necessary SAT relaxation. Examples from FPGA routing show how we can determine efficiently when we can satisfy “almost all ” of our geometric constraints