9. Gent I. P., Walsh T.: The TSP Phase Transition. Artif. Intell. 88, 349--358 (1996) 10. Walsh T.: Where Are the Really Hard Manipulation Problems? The Phase Transition in Manipulating the Veto Rule. In: proc. IJCAI'09, pp. 324--329. Morgan Kaufmann Publishers, Inc. (2009) 
11. Bailey D. D., Dalmau V., Kolaitis P. G.: Phase Transitions of PP-Complete Satisfiability Problems. In: proc. IJCAI'01, pp. 183--192. Morgan Kaufmann Publishers, Inc. (2001) 
12. Li L., Liu T., Xu K.: Exact phase transition of backtrack-free search with implications on the power of greedy algorithms. arXiv:0811.3055 (2008) 
13. Cadoli, M., and Donini, F.: A survey on knowledge compilation. AI Communications 10, 137--150 (1998) 
14. Narodytska N., Walsh T.: Constraint and Variable Ordering Heuristics for Compiling Configuration Problems. In: proc. IJCAI'07, pp. 149--154. Morgan Kaufmann Publishers, Inc. 

(2007) 
15. Selman B., Kautz H. A.: Knowledge Compilation and Theory Approximation. J. ACM 43, 193--224 (1996) 
16. Darwiche A.: A Compiler for Deterministic, Decomposable Negation Normal Form. In: proc. 

AAAI/IAAI'02: pp. 627--634. AAAI Press (2002) 
17. Amilhastre J., Fargier H., Marquis P.: Consistency restoration and explanations in dynamic CSPs Application to configuration. Artif. Intell. 135, 199--234 (2002) 
18. Mateescu R., Dechter R., Marinescu R.: AND/OR Multi-Valued Decision Diagrams (AOMDDs) 
for Graphical Models. J. Artif. Intell. Res. 33, 465--519 (2008) 
19. Darwiche A., Marquis P.: A Knowledge Compilation Map. J. Artif. Intell. Res. 17, 229--264 
(2002) 
20. Schrag R., Crawford J. M.: Implicates and prime implicates in Random 3-SAT. Artificial Intelligence, 81, 199--222 (1996) 
21. Mitchell D.G., Selman B., Levesque H.J.: Hard and Easy Distributions of SAT Problems. In: 
proc. AAAI'92, pp. 459--465. AAAI Press (1992) 
22. Birnbaum E., Lozinskii E. L.: The Good Old Davis-Putnam Procedure Helps Counting Models. J. 

Artif. Intell. Res. 10, 457--477 (1999) 
23. Roberto J. Bayardo Jr., Pehoushek J. D: Counting Models Using Connected Components. In: 
proc. AAAI'00, pp. 157--162. AAAI Press (2000) 
24. Vempary N.R. Solving constraint satisfaction problems using finite state automata. In: proc. 

AAAI'92, pp. 453--458. AAAI Press (1992) 
25. Freuder E.C.: Eliminating Interchangeable Values in Constraint Satisfaction Problems. In proc. 

AAAI'91, pp. 227--233. AAAI Press (1991) 
26. Boufkhad Y., Dubois O.: Length of Prime Implicants and Number of Solutions of Random CNF 
Formulae. Theor. Comput. Sci. 215(1-2): 1-30 (1999) 