Tools for modeling and solving search problems

In this paper, we describe a language PSpb to model search problems that are specified in terms of boolean combinations of pseudo-boolean constraints. We then describe software tools that allow one to use SAT and SAT(PB) solvers to compute solutions to instances of search problems represented in the language PSpb.