Layout Decomposition via Boolean Satisfiability.
Hongduo LiuPeiyu LiaoMengchuan ZouBowen PangXijun LiMingxuan YuanTsung-Yi HoBei YuPublished in: DAC (2023)
Keyphrases
- boolean satisfiability
- sat solvers
- sat solving
- probabilistic planning
- boolean optimization
- randomly generated
- integer linear programming
- branch and bound algorithm
- symmetry breaking
- maximum satisfiability
- sat problem
- max sat
- special case
- combinatorial problems
- random sat instances
- search algorithm
- sat instances
- search strategy
- constraint satisfaction
- heuristic search
- domain specific
- search space