SAT sweeping with local observability don't-cares.
Qi ZhuNathan KitchenAndreas KuehlmannAlberto L. Sangiovanni-VincentelliPublished in: DAC (2006)
Keyphrases
- sat solvers
- satisfiability problem
- sat problem
- sat solving
- max sat
- stochastic local search
- phase transition
- search strategies
- search algorithm
- sat instances
- boolean satisfiability
- np complete
- propositional satisfiability
- neural network
- constraint satisfaction
- randomly generated
- partially observable
- search procedures
- variable ordering
- data sets