Knowledge compilation meets uniform sampling

DOI10.29007/H4P9zbMATH Open1415.68205OpenAlexW2908408690MaRDI QIDQ5222984FDOQ5222984

Authors: Shubham Sharma, Rahul Gupta, Subhajit Roy, Kuldeep S. Meel 

Publication date: 4 July 2019

Published in: EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.29007/h4p9

Recommendations

• Practically uniform solution sampling in constraint programming
• Fast sampling of perfectly uniform satisfying assignments
• Generating constrained random data with uniform distribution
• Uniform generation in spatial constraint databases and applications
• Multisampling: a new approach to uniform sampling and approximate counting

zbMATH Keywords

SAT solvingknowledge compilationd-DNNFconstrained uniform sampling

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40)

Cited In (4)

• SMT sampling via model-guided approximation
• Knowledge compilation. Preface.
• On the benefits of knowledge compilation for feature-model analyses
• Product optimization in stepwise design

This page was built for publication: Knowledge compilation meets uniform sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222984)