Half-checking Propagators
← All talks

Talk ·

Half-checking Propagators

What changes when a propagator may deliberately remove solutions, while every solution it reports must still be genuine?

Speaker
Mikael Zayenz Lagerkvist
Occasion
ModRef 2020

Recording

Watch the talk

The talk develops the idea of half-checking propagators, explains the deliberately incomplete solving process they create, and shows how completeness can be recovered through a portfolio containing an ordinary complete solver.