1 citations · 1 across the 2 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2025★ 1 cited
Extracting Problem Structure with LLMs for Optimized SAT Local Search
André Schidler, Stefan Szeider
Local search preprocessing makes Conflict-Driven Clause Learning (CDCL) solvers faster by providing high-quality starting points and modern SAT solvers have incorporated this techn…
cs.AI2025
Smart Cubing for Graph Search: A Comparative Study
Markus Kirchweger, Hai Xia, Tomáš Peitl +1
Parallel solving via cube-and-conquer is a key method for scaling SAT solvers to hard instances. While cube-and-conquer has proven successful for pure SAT problems, notably the Pyt…