Local search algorithms for SAT: an empirical evaluation
From MaRDI portal
Recommendations
- Local search algorithms for SAT: an empirical evaluation
- Local search algorithms for SAT: Worst-case analysis
- Stochastic Algorithms: Foundations and Applications
- scientific article; zbMATH DE number 956863
- SAT local search algorithms: Worst-case study
- SAT local search algorithms: Worst-case study
- Local search with a SAT oracle for combinatorial optimization
- Local search characteristics of incomplete SAT procedures
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
Cited in
(45)- Local search algorithms for SAT: an empirical evaluation
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
- Computation of the semantics of autoepistemic belief theories
- On SAT instance classes and a method for reliable performance experiments with SAT solvers
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
- SAT local search algorithms: Worst-case study
- Guided local search for solving SAT and weighted MAX-SAT problems
- Stochastic local search - methods, models, applications (Diss., TU Darmstadt, 1998)
- Ensemble-based prediction of SAT search behaviour
- Auto-Walksat: A self-tuning implementation of Walksat
- Guided local search for solving SAT and weighted MAX-SAT problems
- SAT local search algorithms: Worst-case study
- Randomness in heuristics: An experimental investigation for the maximum satisfiability problem
- An improved local search algorithm for 3-SAT
- Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
- scientific article; zbMATH DE number 5510694 (Why is no real title available?)
- Variable Dependency in Local Search: Prevention Is Better Than Cure
- SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
- A Theoretical Analysis of Search in GSAT
- scientific article; zbMATH DE number 1241386 (Why is no real title available?)
- scientific article; zbMATH DE number 1341458 (Why is no real title available?)
- scientific article; zbMATH DE number 1149403 (Why is no real title available?)
- scientific article; zbMATH DE number 1149448 (Why is no real title available?)
- scientific article; zbMATH DE number 2084727 (Why is no real title available?)
- scientific article; zbMATH DE number 2086447 (Why is no real title available?)
- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
- An empirical study of optimal noise and runtime distributions in local search
- scientific article; zbMATH DE number 1405442 (Why is no real title available?)
- Local search algorithms for SAT: Worst-case analysis
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Another Complete Local Search Method for SAT
- Artificial Intelligence and Symbolic Computation
- AI*IA 2005: Advances in Artificial Intelligence
- Stochastic Algorithms: Foundations and Applications
- scientific article; zbMATH DE number 956863 (Why is no real title available?)
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Local search characteristics of incomplete SAT procedures
- On market-inspired approaches to propositional satisfiability
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability
- Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
- The island confinement method for reducing search space in local search methods
This page was built for publication: Local search algorithms for SAT: an empirical evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2749854)
