Algorithms and complexity results for #SAT and Bayesian inference

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2003-January, Issue , 2003, Pages 340-351

  Bacchus, F ^a   Dalmao, S ^a   Pitassi, T ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Application software; Bayesian methods; Computational modeling; Computer science; Computer simulation; Government; Inference algorithms; Polynomials

Indexed keywords

ALGORITHMS; APPLICATION PROGRAMS; BAYESIAN NETWORKS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COMPUTER SIMULATION; COMPUTER SOFTWARE; POLYNOMIALS;

ALGORITHMS AND COMPLEXITY; BAYESIAN METHODS; COMPUTATIONAL MODEL; GOVERNMENT; INFERENCE ALGORITHM; PROBABILISTIC REASONING; SATISFYING ASSIGNMENTS; TIME SPACE TRADEOFFS;

INFERENCE ENGINES;

EID: 29344464523     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238208     Document Type: Conference Paper

References (22)

1. A. Aleknovich and A. Razborov. Satisfiability, branch-width and tseitin tautologies. In FOCS, 2002.
2. F. Bacchus, S. Dalmao, and T. Pitassi. Value elimination: Bayesian inference via backtracking search. In Uncertainty in Artificial Intelligence (UAI-03), 2003.
3. R. J. Bayardo and J. D. Pehoushek. Counting models using connected components. In Proceedings of the AAAI National Conference (AAAI), pages 157-162, 2000.
4. P. Beame, R. Impagliazzo, T. Pitassi, and N. Segerlind. Memoization and DPLL: Formula caching proof systems. Unpublished manuscript, 2003.
5. M. Bonet, J. L. Esteban, N. Galesi, and J. Johannsen. Exponential separations between restricted resolution and cutting planes proof systems. In FOCS, pages 638-647, 1998.
6. C. Boutilier, N. Friedman, M. Goldszmidt, and D. Koller. Context-specific independence in Bayesian networks. In UAI 96, pages 115-123, 1996.
7. S. A. Cook and R. A. Reckhow. The relative efficiency of propositional proof systems. Journal of Symbolic Logic, 44(1):36-50, 1977.
8. A. Darwiche. Recursive conditioning. Artificial Intelligence, 126:5-41, 2001.
9. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Comm. of the ACM, 4:394-397, 1962.
10. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
11. R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113:41-85, 1999.
12. J. Johannsen. Exponential incomparability of tree-like and ordered resolution. Unpublished manuscript, 2001.
13. S. Lauritzen and D. Spiegelhalter. Local computation with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society Series B, 50(2):157-224, 1988.
14. M. Littman, T. Pitassi, and R. Impagliazzo. New and old algorithms for belief net inference and counting satisfying assignments. Unpublished manuscript, 2001.
15. S. M. Majercik and M. L. Littman. Maxplan: A new approach to probabilistic planning. In Artificial Intelligence Planning and Scheduling (AIPS), pages 86-93, 1998.
16. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Mateo, CA, 2nd edition, 1988.
17. I. Rish and R. Dechter. Resolution versus search: Two strategies for SAT. Journal of Automated Reasoning, 24(1):225-275, January 2000.
18. N. Robertson and P. Seymour. Graph minors X. obstructions to tree-decomposition. Journal of Combinatorial Theory, Series B, 52:153-190, 1991.
19. N. Robertson and P. Seymour. Graph minors XIII. the disjoint paths problem. Journal of Combinatorial Theory, Series B, 63:65-110, 1995.
20. L. Simon and P. Chatalic. Satex web site: http://www.lri.fr/~simon/satex/satex.php3.
21. L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.
22. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal of Computing, 9:410-421, 1979.