Local Restarts

DOI10.1007/978-3-540-79719-7_25zbMath1138.68552OpenAlexW2913803263MaRDI QIDQ3502714

Vadim Ryvchin, Ofer Strichman

Publication date: 27 May 2008

Published in: Theory and Applications of Satisfiability Testing – SAT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79719-7_25

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Between SAT and UNSAT: The Fundamental Difference in CDCL SAT ⋮ Conflict-driven answer set solving: from theory to practice ⋮ Leveraging GPUs for effective clause sharing in parallel SAT solving

Uses Software

• MiniSat

Cites Work

• Optimal speedup of Las Vegas algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: Local Restarts