Generating Diverse Solutions in SAT
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2010170
- Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden
- Generating hard satisfiability problems
- On generating all solutions of generalized satisfiability problems
- Solving the satisfiability problem by using randomized approach
- scientific article; zbMATH DE number 2165692
- scientific article; zbMATH DE number 1692953
- Compiling problem specifications into SAT
Cites work
Cited in
(11)- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
- Generating Diverse Solutions in SAT
- Generating SAT instances with community structure
- scientific article; zbMATH DE number 2165692 (Why is no real title available?)
- Polarity and variable selection heuristics for SAT-based anytime MaxSAT
- Enriching Solutions to Combinatorial Problems via Solution Engineering
- Computing Diverse Optimal Stable Models
- SMT sampling via model-guided approximation
- Exact approaches for the diverse satisfiability problem
- Diversity of answers to conjunctive queries
- Algorithms for the diverse-k-SAT problem: the geometry of satisfying assignments
This page was built for publication: Generating Diverse Solutions in SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3007690)