Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis.
Furong YeChuan LuoShaowei CaiPublished in: CoRR (2024)
Keyphrases
- sat solvers
- propositional satisfiability
- combinatorial optimization
- search space
- maximum satisfiability
- clause learning
- sat solving
- search strategies
- boolean satisfiability
- max sat
- sat problem
- sat instances
- constraint satisfaction
- search heuristics
- student learning
- search algorithm
- orders of magnitude
- upper bound
- tabu search
- pseudo boolean
- combinatorial problems
- global search
- science education
- evolutionary search
- stochastic local search
- genetic algorithm
- simulated annealing
- systematic search
- constraint solver
- search procedure
- knowledge structures
- satisfiability testing
- optimization problems
- quantified boolean formulas
- highly optimized
- metaheuristic
- neighborhood search
- branch and bound
- mental models
- constraint satisfaction problems
- job shop scheduling problem
- boolean formula
- search strategy
- hybrid ga
- hill climbing
- branch and bound algorithm