Exact Minimum Logic Factoring via Quantified Boolean Satisfiability.
Hiroaki YoshidaMakoto IkedaKunihiro AsadaPublished in: ICECS (2006)
Keyphrases
- boolean satisfiability
- sat solvers
- boolean optimization
- probabilistic planning
- branch and bound algorithm
- randomly generated
- sat solving
- symmetry breaking
- sat problem
- max sat
- phase transition
- integer linear programming
- modal logic
- combinatorial problems
- automated reasoning
- np hard
- genetic algorithm
- computational properties
- sat instances
- satisfiability problem
- planning problems
- scheduling problem
- evolutionary algorithm
- random sat instances
- lower bound