Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5714764
DOI10.1007/11527695zbMATH Open1122.68620OpenAlexW2483910514MaRDI QIDQ5714764FDOQ5714764
Authors: Dave A. D. Tompkins, Holger H. Hoos 
Publication date: 16 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11527695
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
Cited In (30)
- Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
- Captain Jack: new variable selection heuristics in local search for SAT
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- SATenstein: automatically building local search SAT solvers from components
- SatEx: A web-based framework for SAT experimentation
- Stochastic local search for SMT: combining theory solvers with WalkSAT
- Breaking Cycle Structure to Improve Lower Bound for Max-SAT
- Decomposing SAT Instances with Pseudo Backbones
- Global versus local search: the impact of population sizes on evolutionary algorithm performance
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$
- Auto-Walksat: A self-tuning implementation of Walksat
- Title not available (Why is that?)
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
- New local search methods for partial MaxSAT
- Improved haplotype assembly using Xor genotypes
- Probabilistic characterization of random Max \(r\)-Sat
- UBCSAT
- Iterative and core-guided maxsat solving: a survey and assessment
- Justification-Based Local Search with Adaptive Noise Strategies
- Cooperative parallel SAT local search with path relinking
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- Automated mathematical discovery and verification: minimizing pentagons in the plane
- Simulating circuit-level simplifications on CNF
- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning
- Efficiently Calculating Evolutionary Tree Measures Using SAT
- 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
Uses Software
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)
