From sampling to model counting

Authors:
Carla P. Gomes;Joerg Hoffmann;Ashish Sabharwal;Bart Selman
Affiliations:
Department of Computer Science, Cornell University, Ithaca, NY;University of Innsbruck, Innsbruck, Austria;Department of Computer Science, Cornell University, Ithaca, NY;Department of Computer Science, Cornell University, Ithaca, NY
Venue:
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Year:
2007

Citing 12
Cited 17

Random generation of combinatorial structures from a uniform

Theoretical Computer Science
On the hardness of approximate reasoning

Artificial Intelligence
Stochastic Boolean Satisfiability

Journal of Automated Reasoning
Counting Models Using Connected Components

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
On the computational power of PP and (+)P

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Towards efficient sampling: exploiting random walk strategies

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Estimating search tree size

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Model counting: a new strategy for obtaining good bounds

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Performing Bayesian inference by weighted model counting

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Evidence for invariants in local search

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
MAP complexity results and approximation methods

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
A new approach to model counting

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing

Better bug reporting with better privacy

Proceedings of the 13th international conference on Architectural support for programming languages and operating systems
Approximate Solution Sampling (and Counting) on AND/OR Spaces

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Volume Computation for Boolean Combination of Linear Arithmetic Constraints

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Approximate counting by sampling the backtrack-free search space

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Probabilistic planning via heuristic forward search and weighted model counting

Journal of Artificial Intelligence Research
Leveraging belief propagation, backtrack search, and statistics for model counting

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Exploiting problem structure for solution counting

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Computing the density of states of Boolean formulas

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Approximate model-based diagnosis using greedy stochastic search

Journal of Artificial Intelligence Research
SampleSearch: Importance sampling in presence of determinism

Artificial Intelligence
Efficient sequential clamping for lifted message passing

KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
Importance sampling-based estimation over AND/OR search spaces for graphical models

Artificial Intelligence
A flat histogram method for computing the density of states of combinatorial problems

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Two approaches to understanding when constraints help clustering

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Measuring plan coverage and overlap for agent reasoning

Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Annealed importance sampling for structure learning in Bayesian networks

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A generalization of SAT and #SAT for robust policy evaluation

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previous approaches, our method does not require uniform or near-uniform samples. It instead converts local search sampling without any guarantees into very good bounds on the model count with guarantees. We give a formal analysis and provide experimental results showing the effectiveness of our approach.