Jan Johannsen: Lower bounds for width-restricted clause learning
—
abgelegt unter:
Oberseminar
05.03.2010 14:15
| Was |
|
|---|---|
| Wann |
05.03.2010 von 14:15 bis 15:45 |
| Wo | Z1.09 (neu: L109) |
| Termin übernehmen |
vCal
iCal
|
Clause learning is a technique used by backtracking-based propositional
satisfiability solvers, where some clauses obtained by an analysis of
conflicts are added to the formula during backtracking. It has been
observed empirically that clause learning does not significantly improve
the performance of a solver when restricted to learning clauses of small
width only. This experience is supported by several lower bound
theorems.
