Ilya's area exam

• Paper: Main Techniques for Solving Real-World SAT Instances
• References cited in the paper:
  1. GRASP: A Search Algorithm for Propositional Satisfiability, by Joao P. Marques-Silva and Karem A. Sakallah, IEEE Transactions on Computers, vol. 48, no. 5, May 1999
  2. Chaff: Engineering an Efficient SAT Solver, by M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik, 39th Design Automation Conference, Las Vegas, June 2001.
  3. BerkMin: a Fast and Robust Sat-Solver, by Evgueni Goldberg and Yakov Novikov, Design Automation and Test in Europe (DATE 2002).
  4. Efficient Conflict Driven Learning in a Boolean Satisfiability Solver, by L. Zhang, C. Madigan, M. Moskewicz, S. Malik, Proceedings of ICCAD 2001, San Jose, CA, Nov. 2001.
  5. Using CSP Look-Back Techniques to Solve Real-World SAT Instances, by Roberto J. Bayardo Jr and Robert C. Schrag, in Proc. of the 14th Nat'l Conf. on Artificial Intelligence, pp. 203-208, 1997.
  6. A. Plaisted and S. Greenbaum. A Structure-preserving Clause Form Translation. Journal of Symbolic Computation, 2:293--304, 1986
  7. The Impact of Branching Heuristics in Propositional Satisfiability Algorithms, by Joao P. Marques-Silva, Proceedings of the 9th Portuguese Conference on Artificial Intelligence (EPIA), September 1999