Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Functional verification methodology for microprocessors using the Genesys test-program generator
DATE '99 Proceedings of the conference on Design, automation and test in Europe
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Writing testbenches: functional verification of HDL models
Writing testbenches: functional verification of HDL models
Modeling design constraints and biasing in simulation using BDDs
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Nonserial Dynamic Programming
Constraint Slving for Test Case Generation
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Hierarchical Representations of Discrete Functions, with Application to Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A scheme for approximating probabilistic inference
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Stimulus generation for constrained random simulation
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
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
Constraint-based random stimuli generation for hardware verification
IAAI'06 Proceedings of the 18th conference on Innovative applications of artificial intelligence - Volume 2
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
A uniform random test data generator for path testing
Journal of Systems and Software
Value-ordering heuristics: search performance vs. solution diversity
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Functional test generation with distribution constraints
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Generating diverse solutions in SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
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
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
Hi-index | 0.00 |
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to transform the constraint network into a belief network that expresses a uniform random distribution over its set of solutions and then use known sampling algorithms over belief networks. The motivation for this tasks comes from hardware verification. Random test program generation for hardware verification can be modeled and performed through CSP techniques, and is an application in which uniform random solution sampling is required.