WSAT(CC) - A Fast Local-Search ASP Solver.
Lengning LiuMiroslaw TruszczynskiPublished in: LPNMR (2004)
Keyphrases
- stochastic local search
- propositional satisfiability
- random sat instances
- quantified boolean formulas
- satisfiability problem
- sat solvers
- clause learning
- answer set programming
- tree search
- search algorithm
- sat solving
- satisfiability modulo theories
- constraint programming
- sat problem
- solving hard
- web applications
- constraint solver
- propositional logic
- randomly generated
- genetic algorithm
- max sat
- global search
- combinatorial optimization
- automated reasoning
- boolean satisfiability
- optimal solution
- tabu search
- orders of magnitude
- davis putnam
- branch and bound
- hard constraints
- memetic algorithm
- constraint satisfaction
- np complete
- sat instances
- temporal logic
- neural network
- boolean formula
- search space
- simulated annealing
- neighborhood search
- combinatorial problems