SATLIB

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.

Keywords for this software

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

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

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

1 2 3 next

  1. Felty, Amy; Momigliano, Alberto; Pientka, Brigitte: Benchmarks for reasoning with syntax trees containing binders and contexts of assumptions (2018)
  2. Smith, Stephen L.; Imeson, Frank: GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (2017)
  3. Sutcliffe, Geoff: The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0 (2017)
  4. 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)
  5. Toda, Takahisa; Soh, Takehide: Implementing efficient All solutions SAT solvers (2016)
  6. Dilkina, Bistra; Gomes, Carla P.; Sabharwal, Ashish: Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (2014)
  7. Stump, Aaron; Sutcliffe, Geoff; Tinelli, Cesare: StarExec: a cross-community infrastructure for logic solving (2014) ioport
  8. Domínguez, Julián; Alba, Enrique: Dealing with hardware heterogeneity: a new parallel search model (2013) ioport
  9. Botev, Zdravko I.; Kroese, Dirk P.: Efficient Monte Carlo simulation via the generalized splitting method (2012)
  10. Gorbenko, Anna; Popov, Vladimir: Computational experiments for the problem of selection of a minimal set of visual landmarks (2012)
  11. Kahl, Fredrik; Strandmark, Petter: Generalized roof duality (2012)
  12. Zinin, M. V.: BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases (2012)
  13. Larrosa, Javier; Nieuwenhuis, Robert; Oliveras, Albert; Rodríguez-Carbonell, Enric: A framework for certified Boolean branch-and-bound optimization (2011)
  14. Masegosa, Antonio D.; Pelta, David A.; González, Juan R.: Solving multiple instances at once: the role of search and adaptation (2011) ioport
  15. Quaresma, Pedro: Thousands of geometric problems for geometric theorem provers (TGTP) (2011)
  16. Amir, Eyal: Approximation algorithms for treewidth (2010)
  17. Brickenstein, Michael; Dreyer, Alexander: Polybori: A framework for Gröbner-basis computations with Boolean polynomials (2009)
  18. 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)
  19. Dilkina, Bistra; Gomes, Carla P.; Sabharwal, Ashish: Backdoors in the context of learning (2009)
  20. Kusper, Gábor; Csőke, Lajos: Better test results for the graph coloring and the pigeonhole problems using DPLL with (k)-literal representation (2009)

1 2 3 next