BerkMin

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 157 articles , 1 standard article )

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

1 2 3 ... 6 7 8 next

  1. Lyu, Yinrun; Chen, Li; Zhang, Changyou; Qu, Dacheng; Min-Allah, Nasro; Wang, Yongji: An interleaved depth-first search method for the linear optimization problem with disjunctive constraints (2018)
  2. Marques-Silva, Joao; Malik, Sharad: Propositional SAT solving (2018)
  3. Audemard, Gilles; Lagniez, Jean-Marie; Szczepanski, Nicolas; Tabary, Sébastien: A distributed version of Syrup (2017)
  4. Liang, Jia Hui; Hari Govind, V. K.; Poupart, Pascal; Czarnecki, Krzysztof; Ganesh, Vijay: An empirical study of branching heuristics through the lens of global learning rate (2017)
  5. Kroening, Daniel; Strichman, Ofer: Decision procedures. An algorithmic point of view (2016)
  6. Liang, Jia Hui; Ganesh, Vijay; Poupart, Pascal; Czarnecki, Krzysztof: Learning rate based branching heuristic for SAT solvers (2016)
  7. Li, Pingke; Jin, Qingwei: On the resolution of bipolar max-min equations. (2016)
  8. Biere, Armin; Fröhlich, Andreas: Evaluating CDCL variable scoring schemes (2015)
  9. Achá, Roberto Asín; Nieuwenhuis, Robert: Curriculum-based course timetabling with SAT and MaxSAT (2014)
  10. Alviano, Mario; Dodaro, Carmine; Faber, Wolfgang; Leone, Nicola; Ricca, Francesco: WASP: a native ASP solver based on constraint learning (2013)
  11. Menai, Mohamed El Bachir; Al-Yahya, Tasniem Nasser: A taxonomy of exact methods for partial Max-SAT (2013)
  12. Buss, Samuel R.: Towards NP-P via proof complexity and search (2012)
  13. Cheremisinova, L. D.: Formal verification of logical descriptions with functional uncertainty based on logarithmic encoding of conditions (2012)
  14. Fischetti, Matteo; Monaci, Michele: Cutting plane versus compact formulations for uncertain (integer) linear programs (2012)
  15. Gebser, Martin; Kaufmann, Benjamin; Schaub, Torsten: Conflict-driven answer set solving: from theory to practice (2012)
  16. Martins, Ruben; Manquinho, Vasco; Lynce, In^es: An overview of parallel SAT solving (2012)
  17. Van Gelder, Allen: Producing and verifying extremely large propositional refutations (2012)
  18. Abío, Ignasi; Deters, Morgan; Nieuwenhuis, Robert; Stuckey, Peter J.: Reducing chaos in SAT-like search: finding solutions close to a given one (2011)
  19. Ábrahám, Erika; Schubert, Tobias; Becker, Bernd; Fränzle, Martin; Herde, Christian: Parallel SAT solving in bounded model checking (2011)
  20. Aschinger, Markus; Drescher, Conrad; Friedrich, Gerhard; Gottlob, Georg; Jeavons, Peter; Ryabokon, Anna; Thorstensen, Evgenij: Optimization methods for the partner units problem (2011)

1 2 3 ... 6 7 8 next