Tools for modeling and solving search problems

Abstract. In this paper, we describe a language PS pb to model search problems that are specified in terms of boolean combinations of pseudoboolean constraints. We then describe software tools that allow one to use SAT solvers to compute solutions to instances of search problems represented in the language PS pb.