Heuristics for fast exact model counting

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 226-240

  Sang, Tian ^a   Beame, Paul ^a   Kautz, Henry ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBABILITY; RANDOM PROCESSES;

BOOLEAN MATRIX; CLAUSE LEARNING; PROBABILISTIC REASONING; RANDOM FORMULAS;

PROBLEM SOLVING;

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

References (14)

1. G. Lalas A. Kaporis, L. Kirousis. The probabilistics analysis of a greedy satisfiability algorithm. In European Symposium on Algorithms, volume 2461 of Lecture Notes in Computer Science, pages 574-585, 2002.
2. F. Bacchus, S. Dalmao, and T. Pitassi. Algorithms and Complexity Results for #SAT and Bayesian inference. In Proceedings 44th Annual Symposium on Foundations of Computer Science, Boston, MA, October 2003. IEEE.
3. F. Bacchus, S. Dalmao, and T. Pitassi. Value elimination: Bayesian inference via backtracking search. In Uncertainty in Artificial Intelligence (UAI-2003), pages 20-28, 2003.
4. Roberto J. Bayardo Jr. and Joseph D. Pehoushek. Counting models using connected components. In Proceedings, AAAI-00: 17th National Conference on Artificial Intelligence, pages 157-162, 2000.
5. Paul Beame, Russell Impagliazzo, Toniann Pitassi, and Nathan Segerlind. Memorization and DPLL: Formula Caching proof systems. In Proceedings Eighteenth Annual IEEE Conference on Computational Complexity, pages 225-236, Aarhus, Denmark, July 2003.
6. E. Goldberg and Y. Novikov. Berkmin: a fast and robust sat-solver. In Proceedings of the Design and Test in Europe Conference, pages 142-149, March 2002.
7. S. M. Majercik and M. L. Littman. Using caching to solve larger probabilistic planning problems. In Proceedings of the 14th AAAI, pages 954-959, 1998.
8. J. P. Marques Silva and K. A. Sakallah. GRASP - a new search algorithm for satisfiability. In Proceedings of the International Conference on Computer Aided Design, pages 220-227, San Jose, CA, November 1996. ACM/IEEE.
9. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference, pages 530-535, Las Vegas, NV, June 2001. ACM/IEEE.
10. Tian Sang, Fahiem Bacchus, Paul Beame, Henry Kautz, and Toniann Pitassi. Combining component caching and clause learning for effective model counting. In Seventh International Conference on Theory and Applications of Satisfiability Testing, 2004.
11. Tian Sang, Paul Beame, and Henry Kautz. Solving bayeian networks by weighted model counting. Submitted, 2005.
12. J. P. Marques Silva. The impact of branching heuristics in prepositional satisfiability algorithms. In Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence, pages 62-74, 1999.
13. Hantao Zhang. SATO: An efficient prepositional proven In Proceedings of the International Conference on Automated Deduction, LNAI, volume 1249, pages 272-275, July 1997.
14. L. Zhang, C. F. Madigan, M. H. Moskewicz, and S. Malik. Efficient conflict driven learning in a boolean satisfiability solver. In Proceedings of the International Conference on Computer Aided Design, pages 279-285, San Jose, CA, November 2001. ACM/IEEE.