ZetaSAT - Boolean SATisfiability solving on Desktop Grids.
Wolfgang BlochingerW. WestjeWolfgang KüchlinSebastian WedeniwskiPublished in: CCGRID (2005)
Keyphrases
- boolean optimization
- boolean satisfiability
- sat solving
- branch and bound algorithm
- sat solvers
- randomly generated
- probabilistic planning
- random sat instances
- sat problem
- integer linear programming
- boolean formula
- maximum satisfiability
- sat instances
- symmetry breaking
- nonlinear programming
- np complete
- max sat
- orders of magnitude
- search tree
- phase transition
- combinatorial optimization