On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving.
Ruben MartinsSaurabh JoshiVasco M. ManquinhoInês LyncePublished in: J. Satisf. Boolean Model. Comput. (2014)
Keyphrases
- orders of magnitude
- sat solvers
- boolean satisfiability
- max sat
- sat instances
- boolean optimization
- sat solving
- combinatorial optimization
- clause learning
- sat problem
- maximum satisfiability
- upper bound
- data sets
- stochastic local search
- neural network
- solving problems
- randomly generated
- branch and bound algorithm
- np complete
- data driven
- information retrieval