Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2243408 (Why is no real title available?)
- An overview of backtrack search satisfiability algorithms
- Local search algorithms for SAT: an empirical evaluation
- Stochastic local search. Foundations and applications.
- Theory and Applications of Satisfiability Testing
- Variable Dependency in Local Search: Prevention Is Better Than Cure
Cited in
(7)- scientific article; zbMATH DE number 1149437 (Why is no real title available?)
- Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
- scientific article; zbMATH DE number 2019591 (Why is no real title available?)
- On the effect of learned clauses on stochastic local search
- Nonsystematic search and no-good learning
- Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases
- The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study
This page was built for publication: Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3502713)