Treengeling

Lingeling, Plingeling and Treengeling: Lingeling and its parallel versions Plingeling and Treengeling, obtained first places in 4 tracks (out of 11) of the SAT’14 Competition and thus won 4 Gödel medals during the FLoC’14 Olympic Games.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 44 articles )

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

1 2 3 next

  1. Alam, Jawaherul Md.; Bekos, Michael A.; Dujmović, Vida; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey: On dispersable book embeddings (2021)
  2. Heule, Marijn J. H.; Kauers, Manuel; Seidl, Martina: New ways to multiply (3 \times3)-matrices (2021)
  3. Juma, Nahid; Dietl, Werner; Tripunitara, Mahesh: A computational complexity analysis of tunable type inference for Generic Universe Types (2020)
  4. Junttila, Tommi; Karppa, Matti; Kaski, Petteri; Kohonen, Jukka: An adaptive prefix-assignment technique for symmetry reduction (2020)
  5. Kaufmann, Daniela; Biere, Armin; Kauers, Manuel: Incremental column-wise verification of arithmetic circuits using computer algebra (2020)
  6. Li, Chu-Min; Xiao, Fan; Luo, Mao; Manyà, Felip; Lü, Zhipeng; Li, Yu: Clause vivification by unit propagation in CDCL SAT solvers (2020)
  7. Otpuschennikov, Ilya V.; Semenov, Alexander A.: Using merging variables-based local search to solve special variants of MaxSAT problem (2020)
  8. Pashkovich, Kanstantsin; Poirrier, Laurent: Three-dimensional stable matching with cyclic preferences (2020)
  9. Semenov, Alexander; Otpuschennikov, Ilya; Gribanova, Irina; Zaikin, Oleg; Kochemazov, Stepan: Translation of algorithmic descriptions of discrete functions to SAT with applications to cryptanalysis problems (2020)
  10. Vallade, Vincent; Le Frioux, Ludovic; Baarir, Souheib; Sopena, Julien; Ganesh, Vijay; Kordon, Fabrice: Community and LBD-based clause sharing policy for parallel SAT solving (2020)
  11. Bachmeier, Georg; Brandt, Felix; Geist, Christian; Harrenstein, Paul; Kardel, Keyvan; Peters, Dominik; Seedig, Hans Georg: (k)-majority digraphs and the hardness of voting with a constant number of voters (2019)
  12. Bean, Christian; Gudmundsson, Bjarki; Ulfarsson, Henning: Automatic discovery of structural rules of permutation classes (2019)
  13. Beleĭ, Evgeniya Gennad’evna; Semënov, Aleksandr Anatol’evich: On propositional coding techniques for the distinguishability of objects in finite sets (2019)
  14. Kauers, Manuel; Seidl, Martina; Zeilberger, Doron: On the maximal minimal cube lengths in distinct DNF tautologies (2019)
  15. Kiesl, Benjamin; Heule, Marijn J. H.; Biere, Armin: Truth assignments as conditional autarkies (2019)
  16. Semenov, Alexander A.: Merging variables: one technique of search in pseudo-Boolean optimization (2019)
  17. Tonello, Elisa; Farcot, Etienne; Chaouiya, Claudine: Local negative circuits and cyclic attractors in Boolean networks with at most five components (2019)
  18. Cheng, Xi; Zhou, Min; Song, Xiaoyu; Gu, Ming; Sun, Jiaguang: Parallelizing SMT solving: lazy decomposition and conciliation (2018)
  19. Eggensperger, Katharina; Lindauer, Marius; Hoos, Holger H.; Hutter, Frank; Leyton-Brown, Kevin: Efficient benchmarking of algorithm configurators via model-based surrogates (2018)
  20. Liang, Jia Hui; Oh, Chanseok; Mathew, Minu; Thomas, Ciza; Li, Chunxiao; Ganesh, Vijay: Machine learning-based restart policy for CDCL SAT solvers (2018)

1 2 3 next