论文信息 - And/or tree probabilities of Boolean functions

And/or tree probabilities of Boolean functions

We consider two probability distributions on Boolean functions defined in terms of their representations by $\texttt{and/or}$ trees (or formulas). The relationships between them, and connections with the complexity of the function, are studied. New and improved bounds on these probabilities are given for a wide class of functions, with special attention being paid to the constant function $\textit{True}$ and read-once functions in a fixed number of variables.

Danièle Gardy | Alan R. Woods

[1] Hanno Lefmann,et al. Some typical properties of large AND/OR Boolean formulas , 1997 .

[2] Alan Bundy,et al. Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[3] Zofia Kostrzycka,et al. Statistics of Intuitionistic versus Classical Logics , 2004, Stud Logica.

[4] Grzegorz Matecki,et al. Asymptotic Density for Equivalence , 2005, CLA.

[5] Marek Zaionc. Statistics of implicational logic , 2003, Electron. Notes Theor. Comput. Sci..

[6] Jerzy Tyszkiewicz,et al. Statistical properties of simple types , 2000, Mathematical Structures in Computer Science.

[7] Alan R. Woods. Coloring rules for finite trees, and probabilities of monadic second order sentences , 1997 .

[8] Jeff B. Paris,et al. A Natural Prior Probability Distribution Derived from the Propositional Calculus , 1994, Ann. Pure Appl. Log..

[9] Marek Zaionc. On the Asymptotic Density of Tautologies in Logic of Implication and Negation , 2005, Reports Math. Log..

[10] Alan R. Woods,et al. The number of Boolean functions computed by formulas of a given size , 1998, Random Struct. Algorithms.

[11] Hanno Lefmann,et al. Some typical properties of large AND/OR Boolean formulas , 1997, Random Struct. Algorithms.

[12] Philippe Flajolet,et al. And/Or Trees Revisited , 2004, Comb. Probab. Comput..