Exact Minimum Factoring of Incompletely Specified Logic Functions via Quantified Boolean Satisfiability.
Hiroaki YoshidaMasahiro FujitaPublished in: IPSJ Trans. Syst. LSI Des. Methodol. (2011)
Keyphrases
- boolean satisfiability
- sat solvers
- boolean optimization
- probabilistic planning
- randomly generated
- symmetry breaking
- sat solving
- branch and bound algorithm
- sat problem
- maximum satisfiability
- integer linear programming
- sat instances
- learning algorithm
- max sat
- constraint satisfaction problems
- simulated annealing
- upper bound
- search space
- search algorithm