An overview of backtrack search satisfiability algorithms
From MaRDI portal
(Redirected from Publication:1861908)
Recommendations
Cited in
(27)- Resolution versus search: Two strategies for SAT
- Backtracking tactics in the backtrack method for SAT
- The Complexity of Propositional Proofs
- Finding kernels or solving SAT
- Progress in Artificial Intelligence
- scientific article; zbMATH DE number 1975619 (Why is no real title available?)
- Heuristic-based backtracking relaxation for propositional satisfiability
- Optimal implementation of watched literals and more general techniques
- Random backtracking in backtrack search algorithms for satisfiability
- A sufficient condition for backtrack-bounded search
- scientific article; zbMATH DE number 2085252 (Why is no real title available?)
- Satisfiability-based algorithms for Boolean optimization
- Resolution versus search: Two strategies for SAT
- Incomplete dynamic backtracking for linear pseudo-Boolean problems
- A unified framework for DPLL(T) + certificates
- Partial backtracking in CDCL solvers
- scientific article; zbMATH DE number 2065281 (Why is no real title available?)
- Partition search for non-binary constraint satisfaction
- scientific article; zbMATH DE number 2084763 (Why is no real title available?)
- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning
- Amortized random backtracking
- scientific article; zbMATH DE number 67459 (Why is no real title available?)
- An exercise in transformational programming: Backtracking and Branch-and- Bound
- Solving \#SAT and Bayesian inference with backtracking search
- Algorithms for computing backbones of propositional formulae
- Quantum-walk speedup of backtracking algorithms
- Efficient data structures for backtrack search SAT solvers
This page was built for publication: An overview of backtrack search satisfiability algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1861908)
