BerkMin: A fast and robust SAT-solver. We describe a SAT-solver, BerkMin, that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause “aging”. At the same time BerkMin introduces a new decision-making procedure and a new method of clause database management. We experimentally compare BerkMin with Chaff, the leader among resolution-based SAT-solvers. Experiments show that our program is more robust than Chaff being able to solve more instances than Chaff in a reasonable amount of time.

References in zbMATH (referenced in 146 articles , 1 standard article )

Showing results 1 to 20 of 146.
Sorted by year (citations)

1 2 3 ... 6 7 8 next

  1. Liang, Jia Hui; Ganesh, Vijay; Poupart, Pascal; Czarnecki, Krzysztof: Learning rate based branching heuristic for SAT solvers (2016)
  2. Li, Pingke; Jin, Qingwei: On the resolution of bipolar max-min equations. (2016)
  3. Biere, Armin; Fröhlich, Andreas: Evaluating CDCL variable scoring schemes (2015)
  4. Achá, Roberto Asín; Nieuwenhuis, Robert: Curriculum-based course timetabling with SAT and MaxSAT (2014)
  5. Alviano, Mario; Dodaro, Carmine; Faber, Wolfgang; Leone, Nicola; Ricca, Francesco: WASP: a native ASP solver based on constraint learning (2013)
  6. Menai, Mohamed El Bachir; Al-Yahya, Tasniem Nasser: A taxonomy of exact methods for partial Max-SAT (2013)
  7. Buss, Samuel R.: Towards NP-P via proof complexity and search (2012)
  8. Fischetti, Matteo; Monaci, Michele: Cutting plane versus compact formulations for uncertain (integer) linear programs (2012)
  9. Gebser, Martin; Kaufmann, Benjamin; Schaub, Torsten: Conflict-driven answer set solving: from theory to practice (2012)
  10. Martins, Ruben; Manquinho, Vasco; Lynce, In^es: An overview of parallel SAT solving (2012)
  11. Van Gelder, Allen: Producing and verifying extremely large propositional refutations (2012)
  12. Abío, Ignasi; Deters, Morgan; Nieuwenhuis, Robert; Stuckey, Peter J.: Reducing chaos in SAT-like search: finding solutions close to a given one (2011)
  13. Ábrahám, Erika; Schubert, Tobias; Becker, Bernd; Fränzle, Martin; Herde, Christian: Parallel SAT solving in bounded model checking (2011)
  14. Aschinger, Markus; Drescher, Conrad; Friedrich, Gerhard; Gottlob, Georg; Jeavons, Peter; Ryabokon, Anna; Thorstensen, Evgenij: Optimization methods for the partner units problem (2011)
  15. Atserias, A.; Fichte, J.K.; Thurley, M.: Clause-learning algorithms with many restarts and bounded-width resolution (2011)
  16. Balduccini, Marcello: Learning and using domain-specific heuristics in ASP solvers (2011)
  17. Gebser, Martin; Kaufmann, Benjamin; Kaminski, Roland; Ostrowski, Max; Schaub, Torsten; Schneider, Marius: Potassco: the Potsdam answer set solving collection (2011)
  18. Ibaraki, Toshihide; Imamichi, Takashi; Koga, Yuichi; Nagamochi, Hiroshi; Nonobe, Koji; Yagiura, Mutsunori: Efficient branch-and-bound algorithms for weighted MAX-2-SAT (2011)
  19. Marić, Filip; Janičić, Predrag: Formalization of abstract state transition systems for SAT (2011)
  20. Pipatsrisawat, Knot; Darwiche, Adnan: On the power of clause-learning SAT solvers as resolution engines (2011)

1 2 3 ... 6 7 8 next