论文信息 - Counting Propositional Models

Counting Propositional Models

Abstract Given a propositional DNF or CNF formula F with m clauses on n variables, counting the number of models of F is, at the present state of the art, computationally intractable in a worst case. It is shown that an algorithm based on the Inclusion–Exclusion formula computes the exact number of models of F in average time that under reasonable assumptions in O(mcn), where c = O(logm).

Eliezer L. Lozinskii

[1] John Franco,et al. Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem , 1983, Discret. Appl. Math..

[2] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.

[3] Paul Walton Purdom,et al. Average Time Analyses of Simplified Davis-Putnam Procedures , 1982, Inf. Process. Lett..

[4] Noam Nisan,et al. Approximate Inclusion-Exclusion , 1990, Comb..

[5] Michael Luby,et al. On deterministic approximation of DNF , 1991, STOC '91.

[6] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[7] Eliezer L. Lozinskii,et al. Answering atomic queries in indefinite deductive databases , 1989, Int. J. Intell. Syst..

[8] Paul Walton Purdom,et al. The Pure Literal Rule and Polynomial Average Time , 1985, SIAM J. Comput..

[9] John V. Franco,et al. On the Probabilistic Performance of Algorithms for the Satisfiability Problem , 1986, Inf. Process. Lett..