Abstract
For the third consecutive year, a SAT competition was organized as a joint event with the SAT conference. With 55 solvers from 25 author groups, the competition was a clear success. One of the noticeable facts from the 2004 competition is the superiority of incomplete solvers on satisfiable random k-SAT benchmarks. It can also be pointed out that the complete solvers awarded this year, namely Zchaff, jerusat1.3, satzoo-1.02, kncfsand march-eq, participated in the SAT 2003 competition (or at least former versions of those solvers). This paper is not reporting exhaustive competition results, already available in details online, but rather focuses on some remarkable results derived from the competition dataset.
The SAT 2004 competition is ending a 3-year take-off period that attracted new SAT researchers and provided many new benchmarks and solvers to the community. The good participation rate of this year (despite the addition of the anti-blackbox rule) establishes the competition as an awaited yearly event. Some new directions for a new way of thinking about the competition are discussed at the end of the paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Biere, A.: Resolve and expand. In: Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 59–70. Springer, Heidelberg (2005)
Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of bdds. In: Proceedings of Design Automation Conference, DAC 1999 (1999)
Connamacher, H.: A random constraint satisfaction problem that seems hard for dpll. In: Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542. Springer, Heidelberg (2005)
Tompkins, D.A.D., Hoos, H.H.: Ubcsat: An implementation and experimentation environment for sls algorithms for sat and max-sat, pp. 37–46 (2004)
Dubois, O., Dequen, G.: A backbone-search heuristic for efficient solving of hard 3-sat formulae. In: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), Seattle, Washington, USA, August 4th-10th (2001)
Fang, H., Ruml, W.: Complete local search for propositional satisfiability. In: Proceedings of AAAI 2004 (2004)
Hirsch, E.A., Kojevnikov, A.: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. PDMI preprint 9/2001, Steklov Institute of Mathematics at St.Petersburg (2001), A journal version is submitted to this issue
Hoos, H.: On the runtime behavior of stochastic local search algorithms for SAT. In: Proceedings of AAAI 1999, pp. 661–666 (1999)
Jin, H., Somenzi, F.: CirCUs: A Hybrid Satisfiability Solver. In: Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 211–223. Springer, Heidelberg (2005)
Lardeux, F., Hao, J.-K., Saubion, F.: Evolutionary computing for the satisfiability problem. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 259–268. Springer, Heidelberg (2003)
Kautz, H.A., Selman, B.: Pushing the envelope: Planning, propositional logic, and stochastic search. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1996), pp. 1194–1201 (1996)
Le Berre, D., Simon, L.: The essentials of the SAT 2003 competition. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 452–467. Springer, Heidelberg (2004)
Li, X.Y., Stallmann, M.F., Brglez, F.: QingTing: A Fast SAT Solver Using Local Search and Efficient Unit Propagation. In: Sixth International Conference on Theory and Applications of Satisfiability Testing, S. Margherita Ligure - Portofino, Italy (May 2003), See also http://www.cbl.ncsu.edu/publications/ , and http://www.cbl.ncsu.edu/OpenExperiments/SAT/
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001), June 2001, pp. 530–535 (2001)
Ostrowski, R., Grégoire, E., Mazure, B., Sais, L.: Recovering and exploiting structural knowledge from cnf formulas. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 185–199. Springer, Heidelberg (2002)
Brayton, R.K., Hachtel, G.D., Sangiovanni-Vincentelli, A., Somenzi, F., Aziz, A., Cheng, S.-T., Edwards, S., Khatri, S., Kukimoto, Y., Pardo, A., Qadeer, S., Ranjan, R.K., Sarwary, S., Shiple, T.R., Swamy, G., Villa, T.: VIS: a system for verification and synthesis. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 428–432. Springer, Heidelberg (1996)
Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the 12th National Conference on Artificial Intelligence, AAAI 1994, pp. 337–343 (1994)
Simon, L., Chatalic, P.: SATEx: a web-based framework for SAT experimentation. In: Kautz, H., Selman, B. (eds.) Electronic Notes in Discrete Mathematics, June 2001, vol. 9, Elsevier Science Publishers, Amsterdam (2001), http://www.lri.fr/~simon/satex/satex.php3
Sutcliff, G., Suttner, C.: Evaluating general purpose automated theorem proving systems. Artificial Intelligence 131, 39–54 (2001)
Van Gelder, A.: Another Look at Graph Coloring via Propositional Satisfiability. In: Proceedings of Computational Symposium on Graph Coloring and Generalizations (COLOR 2002), IThaca, NY (September 2002)
Van Gelder, A., Tsuji, Y.K.: Satisfiability Testing with More Reasoning and Less Guessing. In: Johnson, D.S., Trick, M.A. (eds.) Second DIMACS implementation challenge: cliques, coloring and satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 559–586. American Mathematical Society, Providence (1996)
Velev, M.N.: Automatic abstraction of equations in a logic of equality. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol. 2796, pp. 196–213. Springer, Heidelberg (2003)
Velev, M.N., Bryant, R.E.: Effective use of boolean satisfiability procedures in the formal verification of superscalar and vliw microprocessors. In: Proceedings of the 38th Design Automation Conference (DAC 2001), June 2001, pp. 226–231 (2001)
Xu, K., Li, W.: Many hard examples in exact phase transitions with application to generating hard satisfiable instances. Technical report, CoRR Report cs.CC/0302001 (2003), http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/benchmarks.htm
Zarpas, E.: Bmc benchmark illustrations, http://www.haifa.il.ibm.com/projects/verification/RB_Homepage/bmcbenchmarks.html
Zarpas, E.: Benchmarking sat solvers for bounded model checking. Technical report, IBM Haifa Research Laboratory (2004)
Zhang, H.: SATO: an efficient propositional prover. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 272–275. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le Berre, D., Simon, L. (2005). Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. In: Hoos, H.H., Mitchell, D.G. (eds) Theory and Applications of Satisfiability Testing. SAT 2004. Lecture Notes in Computer Science, vol 3542. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527695_25
Download citation
DOI: https://doi.org/10.1007/11527695_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27829-0
Online ISBN: 978-3-540-31580-3
eBook Packages: Computer ScienceComputer Science (R0)