Local Search for Unsatisfiability
From MaRDI portal
Publication:5756575
Recommendations
Cited in
(9)- Proving unsatisfiability of CNFs locally
- Proving unsatisfiability of CNFs locally
- Improvements to Hybrid Incremental SAT Algorithms
- An overview of parallel SAT solving
- The Relation Between Complete and Incomplete Search
- scientific article; zbMATH DE number 956863 (Why is no real title available?)
- Theorem proving as constraint solving with coherent logic
- Finding the hardest formulas for resolution
- Local Symmetry Breaking During Search in CSPs
This page was built for publication: Local Search for Unsatisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756575)