Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5714764
Recommendations
- Local search algorithms for SAT: an empirical evaluation
- Local search algorithms for SAT: an empirical evaluation
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
- Stochastic local search - methods, models, applications (Diss., TU Darmstadt, 1998)
- scientific article; zbMATH DE number 5510694
Cited in
(31)- Justification-Based Local Search with Adaptive Noise Strategies
- Auto-Walksat: A self-tuning implementation of Walksat
- Probabilistic characterization of random Max \(r\)-Sat
- Stochastic local search for SMT: combining theory solvers with WalkSAT
- Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Captain Jack: new variable selection heuristics in local search for SAT
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT
- Efficiently Calculating Evolutionary Tree Measures Using SAT
- Cooperative parallel SAT local search with path relinking
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- Automated mathematical discovery and verification: minimizing pentagons in the plane
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
- scientific article; zbMATH DE number 2084727 (Why is no real title available?)
- Simulating circuit-level simplifications on CNF
- UBCSAT
- SATenstein: automatically building local search SAT solvers from components
- Global versus local search: the impact of population sizes on evolutionary algorithm performance
- Iterative and core-guided maxsat solving: a survey and assessment
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- New local search methods for partial MaxSAT
- Decomposing SAT Instances with Pseudo Backbones
- SatEx: A web-based framework for SAT experimentation
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$
- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning
- Improved haplotype assembly using Xor genotypes
- Improving implementation of SLS solvers for SAT and new heuristics for \(k\)-SAT with long clauses
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
- Using the method of conditional expectations to supply an improved starting point for CCLS
This page was built for publication: Theory and Applications of Satisfiability Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714764)
