Author:
Audemard Gilles,Simon Laurent
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Lecture Notes in Computer Science;A. Biere,2008
2. Brglez, F., Li, X.Y., Stallmann, M.F.: On SAT instance classes and a method for reliable performance experiments with SAT solvers. Annals of Mathematics and Artificial Intelligence 43, 1–34 (2005)
3. Lecture Notes in Computer Science;N. Eén,2004
4. Goldberg, E., Novikov, Y.: BerkMin: A fast and robust SAT-solver. Discrete Applied Mathematics 155(12), 1549–1561 (2007)
5. Hamadi, Y., Jabbour, S., Sais, L.: ManySAT: Solver description. In: System description for the SAT-RACE (2008)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Propositional SAT Solving;Handbook of Model Checking;2018
2. Statistical Methodology for Comparison of SAT Solvers;Theory and Applications of Satisfiability Testing – SAT 2010;2010