# Source: depqbf
# Package: depqbf
# Versions: depqbf (0.1-1)
# Prioritize: 40
Description: solver for quantified boolean formulae
 DepQBF is a search-based solver for quantified boolean formulae (QBF)
 in prenex conjunctive normal form. It is based on the DPLL algorithm
 for QBF with conflict-driven clause and solution-driven cube
 learning. By analyzing the structure of a formula, DepQBF tries to
 identify independent variables. In addition to other benefits, this
 often increases freedom for decision making.
Description-pl: <trans>
 <trans>

# other Descriptions of the depqbf package with a translation in pl:
#