Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325867
Recommendations
- CDCLSym: introducing effective symmetry breaking in SAT solving
- Implementing efficient All solutions SAT solvers
- Improved static symmetry breaking for SAT
- Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
Cited in
(13)- A study of symmetry breaking predicates and model counting
- Symbolic techniques in satisfiability solving
- Implementing efficient All solutions SAT solvers
- Disjunctive closures for knowledge compilation
- Fast, flexible MUS enumeration
- scientific article; zbMATH DE number 7204563 (Why is no real title available?)
- Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers
- Utilizing shelve slots: Sufficiency conditions for some easy instances of hard problems
- Improving the performance of enumerative search methods. II: Computational experiments
- Testing-based formal verification for theorems and its application in software specification verification
- scientific article; zbMATH DE number 6829393 (Why is no real title available?)
- Enumerating All Solutions for Constraint Satisfaction Problems
- Enriching Solutions to Combinatorial Problems via Solution Engineering
This page was built for publication: Theory and Applications of Satisfiability Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325867)