Typical Random 3SAT Formulae and the Satis Ability

3-SAT formulae are deened as nite sets of clauses, each clause being a disjunction of 3 literals over a set of boolean variables. Experiments on solving random 3-SAT formulae have provided strong evidence of a phase transition phenomenon. Explicitly, almost every random 3-SAT formula is satissable when its ratio: number of variables to number of clauses, denoted by c, is less than a value of about 4:25 and becomes unsatissable when this ratio exceeds 4:25. More formally, a critical value ! of the ratio c, the so-called satissability threshold, is thought to exist such that, for a suuciently large number n of variables and for any real ", the probability of satissability of a random 3-SAT formula, decreases from almost 1 to almost 0 as c increases from ! ? " to ! + ". Calculating the value of !, besides being a combinatorial challenge, has appeared as a way to understand better how the space of solutions of random formulae is structured. This is of practical importance for the design of eecient algorithms for solving SAT formulae. Up to now, estimates of ! from above and below have been produced from a `semantic' approach focusing on how a random 3-SAT formula can be satissed by binary assignments (possibly of a particular kind) to its variables. Thus, two lower bounds of ! were calculated : 1:63 and 3:003 2]. And starting from an easy upper bound, 5:19, three others were successively obtained : 4:76 3], 4:643 1] and 4:601 4]. However this semantic approach may be subject to diminishing returns in view of the complexity of the calculations for the latest bounds. In this paper, in order to estimate ! better, a new`syntactic' approach is proposed: This is suggested , e.g., simply by practical experience with a computer-based random generator and solver of formulae. The generator is completely ignorant of semantics, yet for large n, it produces (within a realistic timeframe) either only satissable formulae, for values of c a little below 4:25, or only unsatissable formulae, for values of c a little above 4:25. Only a certain class of formulae is likely to come out of the generator, thètypical' formulae. If we could describe (to a suucient degree) their syntactic structure, the convergence to 0 or to +1 of the expectation of the number of solutions, computed only for these typical formulae, should give a very good indication as …