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 56 articles , 1 standard article )

Showing results 21 to 40 of 56.
Sorted by year (citations)
  1. Larrosa, Javier; Nieuwenhuis, Robert; Oliveras, Albert; Rodríguez-Carbonell, Enric: Branch and bound for Boolean optimization and the generation of optimality certificates (2009)
  2. 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
  3. Sutcliffe, Geoff: The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 (2009)
  4. Weber, Tjark; Amjad, Hasan: Efficiently checking propositional refutations in HOL theorem provers (2009)
  5. Wu, Qiuyi; Li, Yangyang; Jiao, Licheng: A quantum cooperative immune algorithm for SAT problems (2009)
  6. Behle, Markus: On threshold BDDs and the optimal variable ordering problem (2008)
  7. Fournier, Nicolas G.: Modelling the dynamics of stochastic local search on (k)-SAT (2007)
  8. Raths, Thomas; Otten, Jens; Kreitz, Christoph: The ILTP problem library for intuitionistic logic (2007)
  9. Villagra, Marcos; Barán, Benjamín: Ant colony optimization with adaptive fitness function for satisfiability testing (2007)
  10. Anjos, Miguel F.: Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems (2006)
  11. Berghammer, Rudolf; Milanese, Ulf: Relational approach to Boolean logic problems (2006)
  12. Gagliolo, Matteo; Schmidhuber, Jürgen: Learning dynamic algorithm portfolios (2006)
  13. Inoue, Katsumi; Soh, Takehide; Ueda, Seiji; Sasaura, Yoshito; Banbara, Mutsunori; Tamura, Naoyuki: A competitive and cooperative approach to propositional satisfiability (2006)
  14. Quaresma, Pedro; Janičić, Predrag: Integrating dynamic geometry software, deduction systems, and theorem repositories (2006)
  15. Streeter, M. J.; Smith, S. F.: How the landscape of random job shop scheduling instances depends on the ratio of jobs to machines (2006)
  16. Boughaci, Dalila; Drias, Habiba: Efficient and experimental meta-heuristics for MAX-SAT problems (2005)
  17. Brglez, Franc; Li, Xiao Yu; Stallmann, Matthias F.: On SAT instance classes and a method for reliable performance experiments with SAT solvers (2005)
  18. Hirsch, Edward A.; Kojevnikov, Arist: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (2005)
  19. Huang, Jinbo; Darwiche, Adnan: Using DPLL for efficient OBDD construction (2005)
  20. Jurkowiak, Bernard; Li, Chu Min; Utard, Gil: A parallelization scheme based on work stealing for a class of SAT solvers (2005)