Model counting: A new strategy for obtaining good bounds

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 54-61

  Gomes, Carla P ^a   Sabharwal, Ashish ^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

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS; MONTE CARLO METHODS;

COMBINATORIAL PROBLEM; MARKOV CHAIN MONTE CARLO METHODS; MODEL COUNTING;

PROBLEM SOLVING;

EID: 33750707563     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Bayardo Jr., R. J., and Pehoushek, J. D. 2000. Counting models using connected components. In I7th AAAI, 157-162.
2. Darwiche, A. 2005. The quest for efficient probabilistic inference. Invited Talk, UCAI-05.
3. Gomes, C. P., and Sellmann, M. 2004. Streamlined constraint reasoning. In 10th CP, volume 3258 of LNCS, 274-289.
4. Littman, M. L.; Majercik, S. M.; and Pitassi, T. 2001. Stochastic boolean satisfiability. J. Auto. Reasoning 27(3):251-296.
5. Motwani, R., and Raghavan, P. 1994. Randomized Algorithms. Cambridge University Press.
6. Pudlák, P. 1997. Lower bounds for resolution & cutting plane proofs & monotone computations. J. Symb. Logic 62(3):981-998.
7. Roth, D. 1996. On the hardness of approximate reasoning. J. AI 82(1-2):273-302.
8. Sang, T.; Bacchus, F.; Beame, P.; Kautz, H. A.; and Pitassi, T. 2004. Combining component caching and clause learning for effective model counting. In 7th SAT. Online Proceedings.
9. Toda, S. 1989. On the computational power of PP and ⊕P. In 30th FOCS, 514-519.
10. Valiant, L. G., and Vazirani, V. V. 1986. NP is as easy as detecting unique solutions. Theoretical Comput. Sci. 47(3):85-93.
11. Wei, W., and Selman, B. 2005. A new approach to model counting. In 8th SAT, volume 3569 of LNCS, 324-339.