Tools for modeling and solving search problems

Article type: Research Article

Authors: East, Deborah | Iakhiaev, Mikhail | Mikitiuk, Artur | Truszczyński, Mirosław

Affiliations: Department of Computer Science, Texas State University – San Marcos, San Marcos, TX 78666, USA | Department of Computer Science, University of Texas at Austin, Austin, TX 78712-0233, USA | Department of Computer Science, University of Texas at Tyler, Tyler, TX 75799, USA | Department of Computer Science, University of Kentucky, Lexington, KY 40506-0046, USA

Abstract: 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.

Keywords: SAT, pseudo-boolean constraints, grounder

Journal: AI Communications, vol. 19, no. 4, pp. 301-312, 2006