Improvements to Hybrid Incremental SAT Algorithms
From MaRDI portal
Publication:3502706
DOI10.1007/978-3-540-79719-7_17zbMath1138.68544OpenAlexW1600508047MaRDI QIDQ3502706
Florian Letombe, João P. Marques-Silva
Publication date: 27 May 2008
Published in: Theory and Applications of Satisfiability Testing – SAT 2008 (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/265227/1/jpms-sat08b.pdf
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Boosting complete techniques thanks to local search methods
- BerkMin: A fast and robust SAT-solver
- Combining Adaptive Noise and Look-Ahead in Local Search for SAT
- Tools and Algorithms for the Construction and Analysis of Systems
- Theory and Applications of Satisfiability Testing
- Structural Abstraction of Software Verification Conditions
- Correct Hardware Design and Verification Methods
- A Computing Procedure for Quantification Theory
- Theory and Applications of Satisfiability Testing
- Local Search for Unsatisfiability
This page was built for publication: Improvements to Hybrid Incremental SAT Algorithms