Exact Minimum Factoring of Incompletely Specified Logic Functions via Quantified Boolean Satisfiability.
Hiroaki YoshidaMasahiro FujitaPublished in: Inf. Media Technol. (2011)
Keyphrases
- boolean satisfiability
- sat solvers
- sat solving
- boolean optimization
- symmetry breaking
- probabilistic planning
- randomly generated
- integer linear programming
- maximum satisfiability
- sat problem
- max sat
- random sat instances
- branch and bound algorithm
- automated reasoning
- optimal solution
- horn clauses
- sat instances
- combinatorial problems
- phase transition
- constraint programming
- model checking