Tools for modeling and solving search problems

, , [...], and

https://doi.org/10.3233/EAI-2006-377

Abstract

In this paper, we describe a language PS^pb 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 PS^pb.

Keywords

SAT pseudo-boolean constraints grounder

Get full access to this article

View all access options for this article.