References in zbMATH (referenced in 39 articles )

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

1 2 next

  1. Cheng, Xi; Zhou, Min; Song, Xiaoyu; Gu, Ming; Sun, Jiaguang: Parallelizing SMT solving: lazy decomposition and conciliation (2018)
  2. Eggensperger, Katharina; Lindauer, Marius; Hoos, Holger H.; Hutter, Frank; Leyton-Brown, Kevin: Efficient benchmarking of algorithm configurators via model-based surrogates (2018)
  3. Ignatiev, Alexey; Morgado, Antonio; Marques-Silva, Joao: PySAT: A Python toolkit for prototyping with SAT oracles (2018)
  4. Kochemazov, Stepan; Zaikin, Oleg: ALIAS: a modular tool for finding backdoors for SAT (2018)
  5. Bannach, Max; Berndt, Sebastian; Ehlers, Thorsten: Jdrasil: a modular library for computing tree decompositions (2017)
  6. Baud-Berthier, Guillaume; Giráldez-Cru, Jesús; Simon, Laurent: On the community structure of bounded model checking SAT problems (2017)
  7. Brandt, Felix; Geist, Christian; Peters, Dominik: Optimal bounds for the no-show paradox via SAT solving (2017)
  8. Heule, Marijn J. H.; Seidl, Martina; Biere, Armin: Solution validation and extraction for QBF preprocessing (2017)
  9. Hutter, Frank; Lindauer, Marius; Balint, Adrian; Bayless, Sam; Hoos, Holger; Leyton-Brown, Kevin: The configurable SAT solver challenge (CSSC) (2017)
  10. Hyttinen, Antti; Plis, Sergey; Järvisalo, Matti; Eberhardt, Frederick; Danks, David: A constraint optimization approach to causal discovery from subsampled time series data (2017)
  11. Junttila, Tommi; Karppa, Matti; Kaski, Petteri; Kohonen, Jukka: An adaptive prefix-assignment technique for symmetry reduction (2017)
  12. Konnov, Igor; Lazić, Marijana; Veith, Helmut; Widder, Josef: $\textPara^2$: parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (2017)
  13. Konnov, Igor; Veith, Helmut; Widder, Josef: On the completeness of bounded model checking for threshold-based distributed algorithms: reachability (2017)
  14. Le Frioux, Ludovic; Baarir, Souheib; Sopena, Julien; Kordon, Fabrice: Painless: a framework for parallel SAT solving (2017)
  15. 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)
  16. Lindauer, Marius; Hoos, Holger; Leyton-Brown, Kevin; Schaub, Torsten: Automatic construction of parallel portfolios via algorithm configuration (2017)
  17. Nabeshima, Hidetomo; Inoue, Katsumi: Coverage-based clause reduction heuristics for CDCL solvers (2017)
  18. 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)
  19. Niemetz, Aina; Preiner, Mathias; Biere, Armin: Propagation based local search for bit-precise reasoning (2017)
  20. Wickerson, John; Batty, Mark; Sorensen, Tyler; Constantinides, George A.: Automatically comparing memory consistency models (2017)

1 2 next


Further publications can be found at: http://fmv.jku.at/papers/index.html