depqbf binary package in Ubuntu Trusty arm64
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, called QDPLL, with conflict-driven clause and solution-driven
cube learning. By analyzing the syntactic structure of a formula,
DepQBF tries to identify independent variables. In general, information
on independent variables can be represented in the formal framework of
dependency schemes. DepQBF computes the so-called "standard dependency
scheme" of a given formula. In addition to other benefits, information
on independent variables often increases the freedom for decision
making and clause learning.
Publishing history
Date | Status | Target | Component | Section | Priority | Phased updates | Version | ||
---|---|---|---|---|---|---|---|---|---|
2013-10-22 09:13:50 UTC | Published | Ubuntu Trusty arm64 | release | universe | interpreters | Extra | 2.0-1 | ||
|
|||||||||
Deleted | Ubuntu Trusty arm64 | proposed | universe | interpreters | Extra | 2.0-1 | |||
|
|||||||||
2013-10-22 09:16:02 UTC | Superseded | Ubuntu Trusty arm64 | release | universe | interpreters | Extra | 1.0-1 | ||
|