The International SAT Solver Competitions

@article{Jrvisalo2012TheIS,
  title={The International SAT Solver Competitions},
  author={Matti J{\"a}rvisalo and Daniel Le Berre and Olivier Roussel and Laurent Simon},
  journal={AI Magazine},
  year={2012},
  volume={33}
}
is satisfiable is one of the most fundamental problems in computer science, known as the canonical NP-complete Boolean satisfiability (SAT) problem (Biere et al. 2009). In addition to its theoretical importance, major advances in the development of robust implementations of decision procedures for SAT, SAT solvers, have established SAT as an important declarative approach for attacking various complex search and optimization problems. Modern SAT solvers are routinely used as core solving… CONTINUE READING
Highly Cited
This paper has 111 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 71 extracted citations

First international Competition on Runtime Verification: rules, benchmarks, tools, and final results of CRV 2014

International Journal on Software Tools for Technology Transfer • 2017
View 4 Excerpts
Highly Influenced

Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems

Annals of Mathematics and Artificial Intelligence • 2017
View 2 Excerpts
Highly Influenced

Clause Elimination for SAT and QSAT Heule , Marijn 2015

ÄRVISALO, ONSING, EIDL, IERE
-1
View 4 Excerpts
Highly Influenced

111 Citations

0102030'13'15'17'19
Citations per Year
Semantic Scholar estimates that this publication has 111 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

PicoSAT Essentials

JSAT • 2008
View 10 Excerpts
Highly Influenced

The SAT2002 competition

Annals of Mathematics and Artificial Intelligence • 2005

An Extensible SATSolver

N. Eén, N. Sörensson
Revised Selected Papers from the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), volume 2919 of Lecture Notes in Computer Science, 502–518. Berlin: Springer. • 2004
View 3 Excerpts

Similar Papers

Loading similar papers…