The essentials of the SAT 2003 Competition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2919, Issue , 2004, Pages 452-467

  Le Berre, Daniel ^a   Simon, Laurent ^b  

^a UNIVERSITÉ D'ARTOIS   (France)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

SATISFIABILITY TESTING;

FORMAL LOGIC;

EID: 35048878712     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24605-3_34     Document Type: Article

References (22)

1. Sixth International Conference on Theory and Applications of Satisfiability Testing, S. Margherita Ligure - Portofino (Italy), May 2003.
2. N. Alexander. Backtrack search algorithms for prepositional satisfiability: Review and innovations. Master's thesis, Hebrew University of Jerusalem, November 2002.
3. G. Audemard, D. Le Berre, O. Roussel, I. Lynce, and J.P. Marques Silva. Open-SAT: An Open Source SAT Software Project. In Proc. of SAT2003 [1].
4. G. Dequen and O. Dubois. Renormalization as a function of clause lengths for solving random k-sat formulae. In Proceedings of Fifth International Symposium on Theory and Applications of Satisfiability Testing, pages 130-132, 2002.
5. O. Dubois and G. Dequen. A backbone-search heuristic for efficient solving of hard 3-sat formulae. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI'01), Seattle, Washington, USA, August 4th-10th 2001.
6. Niklas Eén and Niklas Sörensson. An extensible SAT solver. In In this issue, 2003.
7. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT-solver. In Design, Automation, and Test in Europe (DATE '02), pages 142-149, March 2002.
8. E. A. Hirsch and A. Kojevnikov. 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.
9. O. Kullmann. Heuristics for SAT algorithms: Searching for some foundations, September 1998.
10. K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, and Y. Shoham. A portfolio approach to algorithm selection. In Proceedings of IJCAI'03, 2003.
11. K. Leyton-Brown, E. Nudelman, and Y.Shoham. Learning the empirical hardness of optimization problems: The case of combinatorial auctions. In Proceedings of CP'02, 2002.
12. X. Y. Li, M.F. Stallmann, and F. Brglez. QingTing: A Fast SAT Solver Using Local Search and Efficient Unit Propagation. In Proc. of SAT2003 [1].
13. Inês Lynce and Jo ao Marques Silva. On implementing more efficient data structures. In Proc. of SAT2003 [1].
14. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC'01), pages 530-535, June 2001.
15. R. Ostrowski, E. Grégoire, B. Mazure, and L. Sais. Recovering and exploiting structural knowledge from cnf formulas. In Proc. of the. Eighth International Conference on Principles and Practice of Constraint Programming (CP'2002), LNCS, pages 185-199, Ithaca (N.Y.), September 2002. Springer.
16. S. D. Prestwich. Randomised backtracking for linear pseudo-boolean constraint problems. In Proc. of 4th Int. Workshop on Integration of AI and OR techniques in CP for Combinatorial Optimisation Problems, 2002.
17. Bart Selman, Henry A. Kautz, and David A. McAllester. Ten challenges in prepositional reasoning and search. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97), pages 50-54, 1997.
18. Laurent Simon and Philippe Chatalic. SATEx: a web-based framework for SAT experimentation. In Henry Kautz and Bart Selman, editors, Electronic Notes in Discrete Mathematics, volume 9. Elsevier Science Publishers, June 2001.
19. Laurent Simon, Daniel Le Berre, and Edward E. Hirsch. The sat2002 competition report. Annals of Mathematics and Artificial Intelligence, 2003. Special issue for SAT2002, to appear.
20. Geoff Sutcliff and Christian Suttner. Evaluating general purpose automated theorem proving systems. Artificial Intelligence, 131:39-54, 2001.
21. Hantao Zhang. SATO: an efficient prepositional prover. In Proceedings of the International Conference on Automated Deduction (CADE'97), volume 1249 of LNAI, pages 272-275, 1997.
22. L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In International Conference on Computer-Aided Design (ICCAD'01), pages 279-285, November 2001.