Boosting complete techniques thanks to local search methods
From MaRDI portal
Publication:1267775
DOI10.1023/A:1018999721141zbMATH Open0905.68143OpenAlexW1495369628MaRDI QIDQ1267775FDOQ1267775
Bertrand Mazure, E. Grégoire, Lakhdar Sais
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
Cited In (15)
- About the incremental validation of first-order stratified knowledge-based decision-support systems
- The state of SAT
- A taxonomy of exact methods for partial Max-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
Uses Software
Recommendations
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)
