Improvements to Hybrid Incremental SAT Algorithms
From MaRDI portal
Recommendations
- Boosting SAT solver performance via a new hybrid approach
- Solving the incremental satisfiability problem
- Improved algorithms for the general exact satisfiability problem
- An Improved SAT Algorithm in Terms of Formula Length
- Incremental inprocessing in SAT solving
- scientific article; zbMATH DE number 2084763
- Improved exact algorithms for MAX-SAT
- scientific article; zbMATH DE number 2086240
- Improved approximation algorithms for MAX SAT
- scientific article; zbMATH DE number 1445292
Cites work
- A Computing Procedure for Quantification Theory
- BerkMin: A fast and robust SAT-solver
- Boosting complete techniques thanks to local search methods
- Combining Adaptive Noise and Look-Ahead in Local Search for SAT
- Correct Hardware Design and Verification Methods
- scientific article; zbMATH DE number 1903357 (Why is no real title available?)
- Local Search for Unsatisfiability
- Stochastic local search. Foundations and applications.
- Structural Abstraction of Software Verification Conditions
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(6)- Deep cooperation of CDCL and local search for SAT
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Efficient SAT solving under assumptions
- Boosting SAT solver performance via a new hybrid approach
- Solving the incremental satisfiability problem
- Theory and Applications of Satisfiability Testing
This page was built for publication: Improvements to Hybrid Incremental SAT Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3502706)
