1. D. Achlioptas, C. P. Gomes, H. Kautz, and B. Selman. Generating satisfiable problem instances. In Proc. of AAAI-2000, pages 256–261, 2000.
2. R. J. Bayardo and R. C. Schrag. Using CSP look-back techniques to solve realworldSA T instances. In Proc. of AAAI’97, pages 203–208, 1997.
3. B. Beckert, R. Hähnle and F. Manyà. The SAT problem of signedCNF formulas. In Labelled Deduction, pages 61–82, Kluwer, 2000.
4. R. Béjar. Systematic and Local Search Algorithms for Regular-SAT. PhD thesis, Universitat Autònoma de Barcelona, 2000.
5. R. Béjar and F. Manyà. Phase transitions in the regular random 3-SAT problem. In Proc. of ISMIS’99, pages 292–300. LNAI 1609, 1999.