Satisfiability solvers targeting industrial instances are currently almost always based on conflict-driven clause learning (CDCL) [5]. This technique can successfully solve very large instances. Yet on small, hard problems lookahead solvers [3] often perform better by applying much more reasoning in each search node and then recursively splitting the search space until a solution is found. © 2012 Springer-Verlag.
CITATION STYLE
Van Der Tak, P., Heule, M. J. H., & Biere, A. (2012). Concurrent cube-and-conquer (Poster presentation). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7317 LNCS, pp. 475–476). https://doi.org/10.1007/978-3-642-31612-8_42
Mendeley helps you to discover research relevant for your work.