7 search results - page 2 / 2 » SATenstein: Automatically building local search SAT solvers ... |
AAAI
2010
13 years 6 months ago
2010
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...
SAT
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...