Random generation of combinatorial structures from a uniform
Theoretical Computer Science
On selecting a satisfying truth assignment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
On the hardness of approximate reasoning
Artificial Intelligence
Neural Networks for Pattern Recognition
Neural Networks for Pattern Recognition
Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
Unifying SAT-based and Graph-based Planning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Counting Models Using Connected Components
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
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
State space exploration using feedback constraint generation and Monte-Carlo sampling
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Stimulus generation for constrained random simulation
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Dynamic inference of likely data preconditions over predicates by tree learning
ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
Random stimulus generation using entropy and XOR constraints
Proceedings of the conference on Design, automation and test in Europe
Approximate Solution Sampling (and Counting) on AND/OR Spaces
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Just Add Weights: Markov Logic for the Semantic Web
Uncertainty Reasoning for the Semantic Web I
A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Sound and efficient inference with probabilistic and deterministic dependencies
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Joint unsupervised coreference resolution with Markov logic
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
A general method for reducing the complexity of relational inference and its application to MCMC
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
From sampling to model counting
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
High Performing Algorithms for MAP and Conditional Inference in Markov Logic
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Recognizing activities with multiple cues
Proceedings of the 2nd conference on Human motion: understanding, modeling, capture and animation
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
Probabilistic inductive logic programming
Adaptive Markov Logic Networks: Learning Statistical Relational Models with Dynamic Parameters
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Soft evidential update via Markov chain Monte Carlo inference
KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
Computing the density of states of Boolean formulas
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
SampleSearch: Importance sampling in presence of determinism
Artificial Intelligence
Scalable Uniform Graph Sampling by Local Computation
SIAM Journal on Scientific Computing
Boosting learning and inference in Markov logic through metaheuristics
Applied Intelligence
Tuffy: scaling up statistical inference in Markov logic networks using an RDBMS
Proceedings of the VLDB Endowment
SAT-based semiformal verification of hardware
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Database foundations for scalable RDF processing
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
A new algorithm for sampling CSP solutions uniformly at random
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A new approach to model counting
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Proceedings of the International Conference on Computer-Aided Design
An efficient Monte-Carlo algorithm for pricing combinatorial prediction markets for tournaments
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Synthesis of tiled patterns using factor graphs
ACM Transactions on Graphics (TOG)
A robust general constrained random pattern generator for constraints with variable ordering
Proceedings of the International Conference on Computer-Aided Design
Proceedings of the 50th Annual Design Automation Conference
Automated reasoning, fast and slow
CADE'13 Proceedings of the 24th international conference on Automated Deduction
A scalable and nearly uniform generator of SAT witnesses
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a propositional theory. We consider the question of whether state-of-the-art satisfiability procedures, based on random walk strategies, can be used to sample uniformly or nearuniformly from the space of satisfying assignments. We first show that random walk SAT procedures often do reach the full set of solutions of complex logical theories. Moreover, by interleaving random walk steps with Metropolis transitions, we also show how the sampling becomes near-uniform.