References in zbMATH (referenced in 75 articles )

Showing results 41 to 60 of 75.
Sorted by year (citations)
  1. Baud-Berthier, Guillaume; Giráldez-Cru, Jesús; Simon, Laurent: On the community structure of bounded model checking SAT problems (2017)
  2. Brandt, Felix; Geist, Christian; Peters, Dominik: Optimal bounds for the no-show paradox via SAT solving (2017)
  3. Heule, Marijn J. H.; Seidl, Martina; Biere, Armin: Solution validation and extraction for QBF preprocessing (2017)
  4. Hutter, Frank; Lindauer, Marius; Balint, Adrian; Bayless, Sam; Hoos, Holger; Leyton-Brown, Kevin: The configurable SAT solver challenge (CSSC) (2017)
  5. Hyttinen, Antti; Plis, Sergey; Järvisalo, Matti; Eberhardt, Frederick; Danks, David: A constraint optimization approach to causal discovery from subsampled time series data (2017)
  6. Junttila, Tommi; Karppa, Matti; Kaski, Petteri; Kohonen, Jukka: An adaptive prefix-assignment technique for symmetry reduction (2017)
  7. Konnov, Igor; Lazić, Marijana; Veith, Helmut; Widder, Josef: (\textPara^2): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (2017)
  8. Konnov, Igor; Veith, Helmut; Widder, Josef: On the completeness of bounded model checking for threshold-based distributed algorithms: reachability (2017)
  9. Le Frioux, Ludovic; Baarir, Souheib; Sopena, Julien; Kordon, Fabrice: Painless: a framework for parallel SAT solving (2017)
  10. 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)
  11. Lindauer, Marius; Hoos, Holger; Leyton-Brown, Kevin; Schaub, Torsten: Automatic construction of parallel portfolios via algorithm configuration (2017)
  12. Nabeshima, Hidetomo; Inoue, Katsumi: Coverage-based clause reduction heuristics for CDCL solvers (2017)
  13. Nejati, Saeed; Newsham, Zack; Scott, Joseph; Liang, Jia Hui; Gebotys, Catherine; Poupart, Pascal; Ganesh, Vijay: A propagation rate based splitting heuristic for divide-and-conquer solvers (2017)
  14. Niemetz, Aina; Preiner, Mathias; Biere, Armin: Propagation based local search for bit-precise reasoning (2017)
  15. Wickerson, John; Batty, Mark; Sorensen, Tyler; Constantinides, George A.: Automatically comparing memory consistency models (2017)
  16. Balyo, Tomáš; Biere, Armin; Iser, Markus; Sinz, Carsten: SAT race 2015 (2016)
  17. Heule, Marijn J. H.; Kullmann, Oliver; Marek, Victor W.: Solving and verifying the Boolean Pythagorean triples problem via cube-and-conquer (2016)
  18. Kroening, Daniel; Strichman, Ofer: Decision procedures. An algorithmic point of view (2016)
  19. Liang, Jia Hui; Ganesh, Vijay; Poupart, Pascal; Czarnecki, Krzysztof: Learning rate based branching heuristic for SAT solvers (2016)
  20. Manthey, Norbert; Lindauer, Marius: SpyBug: automated bug detection in the configuration space of SAT solvers (2016)

Further publications can be found at: