Boosting complete techniques thanks to local search methods
From MaRDI portal
Publication:1267775
DOI10.1023/A:1018999721141zbMath0905.68143OpenAlexW1495369628MaRDI QIDQ1267775
Bertrand Mazure, Éric Grégoire, Lakhdar Saïs
Publication date: 25 November 1998
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018999721141
Related Items
Local-search extraction of mUSes ⋮ The state of SAT ⋮ Unnamed Item ⋮ Solution techniques for the large set covering problem ⋮ Unnamed Item ⋮ Combining incomplete search and clause generation: an application to the orienteering problems with time windows ⋮ A Decision-Making Procedure for Resolution-Based SAT-Solvers ⋮ Improvements to Hybrid Incremental SAT Algorithms ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ Random constraint satisfaction: easy generation of hard (satisfiable) instances ⋮ Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems ⋮ Sketch-based pruning of a solution space within a formal geometric constraint solver ⋮ About the incremental validation of first-order stratified knowledge-based decision-support systems ⋮ Deep cooperation of CDCL and local search for SAT ⋮ Leveraging GPUs for effective clause sharing in parallel SAT solving
Uses Software
