A new approach to model counting

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 324-339

  Wei, Wei ^a   Selman, Bart ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; FORMAL LOGIC; MATHEMATICAL MODELS;

APPROXCOUNT ALGORITHM; BACKTRACK TYPE ALGORITHMS; BAYESIAN NETWORK; PROPOSITIONAL LOGIC;

ALGORITHMS;

EID: 26444526219     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499107_24     Document Type: Conference Paper

References (19)

1. R. J. Bayardo, Jr. and J. D. Pehoushek. Counting Models Using Connected Components. In Proc. AAAI-00, 2000
2. E. Birnbaum and E. L. Lozinskii. The Good Old Davis-Putnam Procedure Helps Counting Models. Journal of Artificial Intelligence Research, 10:457-477, 1999.
3. A. Darwiche. A Compiler for Deterministic, Decomposable Negation Normal Form. In Proc. AAAI-02, 2002.
4. M. Davis, G. Logemann, and D. Loveland. A Machine Program for Theorem-Proving. Communications of the ACM, 5:394-397, 1962.
5. H. H. Hoos and T. Stützle. SATLIB: An Online Resource for Research on SAT. In I. P. Gent, H. v.Maaren, T. Walsh, editors, SAT 2000, pp.283-292, IOS Press, 2000. SATLIB is available online at www.satlib.org.
6. J. Huang and A. Darwiche. Using DPLL for Efficient OBDD Construction. In Proc. SAT-04, 2004
7. M. R. Jerrum, L. G. Valiant, V. V. Vazirani. Random Generation of Combinatorial Structures from a Uniform Distribution. Theoretical Computer Science 43, 169-188, 1986.
8. H. Kautz and B. Selman. Planning as Satisfiability. In Proceedings ECAI-92, 1992.
9. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Engineering a Highly Efficient SAT Solver. 38th Design Autom. Conference (DAC 01), 2001.
10. C. H. Papadimitriou. On Selecting a Satisfying Truth Assignment. In Proceedings of the Conference on the Foundations of Computer Science, pages 163-169, 1991.
11. D. Roth. On the Hardness of Approximate Reasoning. Artificial Intelligence 82, 273-302, 1996.
12. T. Sang, F. Bacchus, P. Beame, H. Kautz, and T. Pitassi. Combining Component Caching and Clause Learning for Effective Model Counting. In Proc. SAT-04, 2004.
13. B. Selman, H. Kautz, and B. Cohen. Local Search Strategies for Satisfiability Testing. 2nd DIMACS Challenge on Cliques, Coloring and Satisfiability, 1994.
14. S. Toba. PP is as Hard as the Polynomial-Time Hierarchy. SIAM Journal on Computing, Vol. 20, No. 5, 865-877, 1991.
15. L. G. Valiant. The Complexity of Enumeration and Reliability Problems. SIAM Journal on Computing, Vol. 8, No. 3, 410-421, 1979.
16. M. N. Velev and R. E. Bryant. Effective Use of Boolean Satisfiability Procedures in the Formal Verification of Superscalar and VLIW Microprocessors. Journal of Symbolic Computation, Vol. 35, No. 2, pp. 73-106, 2003.
17. W. Wei, J. Erenrich, and B. Selman. Towards Efficient Sampling: Exploiting Random Walk Strategies. In Proc. AAAI-04, 2004.
18. W. Wei and B. Selman. Accelerating Random Walks. In Proc. CP-02, 2002.
19. SAT Competition. http://www.satcompetition.org