[7] M. Davis & H. Putnam (1960): A Computing Procedure for Quantification Theory. Journal of the Association for Computing Machinery 7(3), pp. 201–215.

[8] J. L. Esteban & J. Toran (2001): ´ Space bounds for resolution. *Information and Computation* 171(1), pp.

84–97.

[9] H. Fang & W. Ruml (2004): *Complete Local Search for Propositional Satisfiability*. In: AAAI Conference on Artificial Intelligence. pp. 161–166.

[10] E. A. Hirsch & A. Kojevnikov (2001): *Solving Boolean Satisfiability Using Local Search Guided by Unit* Clause Elimination. In: International Conference on Principles and Practice of Constraint Programming
(CP). pp. 605–609.

[11] H. Hoos & T. Stutzle (2004): ¨ *Stochastic Local Search: Foundations & Applications*. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.

[12] D. Le Berre (2001): *Exploiting the real power of Unit Propagation Lookahead*. In: *Workshop on Theory and* Applications of Satisfiability Testing (SAT). pp. 8–16.

[13] I. Lynce & J. P. Marques-Silva (2003): *Probing-Based Preprocessing Techniques for Propositional Satisfiability*. In: *IEEE International Conference on Tools with Artificial Intelligence (ICTAI)*. pp. 105–110.

[14] S. Prestwich & I. Lynce (2006): *Local Search for Unsatisfiability*. In: International Conference on Theory and Applications of Satisfiability Testing (SAT). pp. 283–296.

[15] E. T. Richards & B. Richards (2000): Nonsystematic Search and No-Good Learning. Journal of Automated Reasoning 24(4), pp. 483–533.

[16] J. A. Robinson (1965): A Machine-Oriented Logic Based on the Resolution Principle. *Journal of the Association for Computing Machinery* 12(1), pp. 23–41.

[17] B. Selman, H. A. Kautz & B. Cohen (1994): *Noise strategies for improving local search*. In: *AAAI Conference on Artificial Intelligence*. pp. 337–343.

[18] B. Selman, H. A. Kautz & D. A. McAllester (1997): *Ten Challenges in Propositional Reasoning and Search*.

In: *International Joint Conference on Artificial Intelligence (IJCAI)*. pp. 50–54.

[19] B. Selman, H. J. Levesque & D. Mitchell (1992): *A New Method for Solving Hard Satisfiability Problems*.

In: *AAAI Conference on Artificial Intelligence*. pp. 440–446.

[20] H. Shen & H. Zhang (2005): *Another complete local search method for SAT*. In: International Conference on Logic for Programming and Automated Reasoning (LPAR). pp. 595–605.

[21] G. Stalmark (1994): *A system for determining propositional logic theorem by applying values and rules to* triplets that are generated from a formula. US Patent 5,276,897; Canadian Patent 2,018,828; European Patent 0403 545; Swedish Patent 467 076 .