depqbf binary package in Ubuntu Precise armel
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.
Publishing history
| Date | Status | Target | Component | Section | Priority | Phased updates | Version | ||
|---|---|---|---|---|---|---|---|---|---|
| 2011-10-20 14:09:29 UTC | Published | Ubuntu Precise armel | release | universe | interpreters | Extra | 0.1-1 | ||
|
|||||||||
