SATLIB is a collection of benchmark problems, solvers, and tools we are using for our own SAT related research. One strong motivation for creating SATLIB is to provide a uniform test-bed for SAT solvers as well as a site for collecting SAT problem instances, algorithms, and empirical characterisations of the algorithms’ performance.

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

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

1 2 3 next

  1. Matsuzaki, Takuya; Iwane, Hidenao; Kobayashi, Munehiro; Zhan, Yiyang; Fukasaku, Ryoya; Kudo, Jumma; Anai, Hirokazu; Arai, Noriko H.: Race against the teens -- benchmarking mechanized math on pre-university problems (2016)
  2. Toda, Takahisa; Soh, Takehide: Implementing efficient All solutions SAT solvers (2016)
  3. Dilkina, Bistra; Gomes, Carla P.; Sabharwal, Ashish: Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (2014)
  4. Stump, Aaron; Sutcliffe, Geoff; Tinelli, Cesare: StarExec: a cross-community infrastructure for logic solving (2014)
  5. Domínguez, Julián; Alba, Enrique: Dealing with hardware heterogeneity: a new parallel search model (2013) ioport
  6. Botev, Zdravko I.; Kroese, Dirk P.: Efficient Monte Carlo simulation via the generalized splitting method (2012)
  7. Gorbenko, Anna; Popov, Vladimir: Computational experiments for the problem of selection of a minimal set of visual landmarks (2012)
  8. Kahl, Fredrik; Strandmark, Petter: Generalized roof duality (2012)
  9. Zinin, M.V.: BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases (2012)
  10. Larrosa, Javier; Nieuwenhuis, Robert; Oliveras, Albert; Rodríguez-Carbonell, Enric: A framework for certified Boolean branch-and-bound optimization (2011)
  11. Masegosa, Antonio D.; Pelta, David A.; González, Juan R.: Solving multiple instances at once: the role of search and adaptation (2011) ioport
  12. Quaresma, Pedro: Thousands of geometric problems for geometric theorem provers (TGTP) (2011)
  13. Amir, Eyal: Approximation algorithms for treewidth (2010)
  14. Brickenstein, Michael; Dreyer, Alexander: Polybori: A framework for Gröbner-basis computations with Boolean polynomials (2009)
  15. Brickenstein, Michael; Dreyer, Alexander; Greuel, Gert-Martin; Wedler, Markus; Wienand, Oliver: New developments in the theory of Gröbner bases and applications to formal verification (2009)
  16. Kusper, Gábor; Csőke, Lajos: Better test results for the graph coloring and the pigeonhole problems using DPLL with $k$-literal representation (2009)
  17. Larrosa, Javier; Nieuwenhuis, Robert; Oliveras, Albert; Rodríguez-Carbonell, Enric: Branch and bound for Boolean optimization and the generation of optimality certificates (2009)
  18. Munawar, Asim; Wahib, Mohamed; Munetomo, Masaharu; Akama, Kiyoshi: Hybrid of genetic algorithm and local search to solve MAX-SAT problem using nvidia CUDA framework (2009) ioport
  19. Sutcliffe, Geoff: The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 (2009)
  20. Weber, Tjark; Amjad, Hasan: Efficiently checking propositional refutations in HOL theorem provers (2009)

1 2 3 next