Practically uniform solution sampling in constraint programming

DOI10.1007/978-3-031-08011-1_22zbMATH Open1502.68278OpenAlexW4285308427MaRDI QIDQ2170209FDOQ2170209

Authors: Gilles Pesant, Claude-Guy Quimper, Hélène Verhaeghe 

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-08011-1_22

Recommendations

• Sampling constraint satisfaction solutions in the local lemma regime
• Solution sampling with random table constraints
• Randomized approximation of the constraint satisfaction problem
• Fast sampling of perfectly uniform satisfying assignments
• scientific article; zbMATH DE number 1002207
• Simultaneous approximation of constraint satisfaction problems
• scientific article; zbMATH DE number 3860894
• Solving and sampling with many solutions: satisfiability and other hard problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Probabilistic planning via heuristic forward search and weighted model counting
• On the usefulness of linear modular arithmetic in constraint programming

Cited In (3)

• Discovering the Characteristics of Mathematical Programs via Sampling
• Branch \& Sample: A simple strategy for constraint satisfaction
• A feature commonality-based search strategy to find high \(t\)-wise covering solutions in feature models

This page was built for publication: Practically uniform solution sampling in constraint programming

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