Boosting complete techniques thanks to local search methods
From MaRDI portal
Recommendations
Cited in
(15)- About the incremental validation of first-order stratified knowledge-based decision-support systems
- A taxonomy of exact methods for partial Max-SAT
- The state of SAT
- Towards an efficient library for SAT: A manifesto
- Deep cooperation of CDCL and local search for SAT
- A Decision-Making Procedure for Resolution-Based SAT-Solvers
- Solution techniques for the large set covering problem
- Combining incomplete search and clause generation: an application to the orienteering problems with time windows
- Improvements to Hybrid Incremental SAT Algorithms
- Leveraging GPUs for effective clause sharing in parallel SAT solving
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Checking depth-limited consistency and inconsistency in knowledge-based systems
- Local-search extraction of mUSes
- Sketch-based pruning of a solution space within a formal geometric constraint solver
This page was built for publication: Boosting complete techniques thanks to local search methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1267775)
