An overview of backtrack search satisfiability algorithms
From MaRDI portal
Publication:1861908
DOI10.1023/A:1021264516079zbMATH Open1010.68069OpenAlexW2127309711MaRDI QIDQ1861908FDOQ1861908
Inês Lynce, Joao Marques-Silva
Publication date: 10 March 2003
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021264516079
Cited In (22)
- Backtracking tactics in the backtrack method for SAT
- The Complexity of Propositional Proofs
- Finding kernels or solving SAT
- Title not available (Why is that?)
- A sufficient condition for backtrack-bounded search
- Heuristic-based backtracking relaxation for propositional satisfiability
- Random backtracking in backtrack search algorithms for satisfiability
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partition search for non-binary constraint satisfaction
- Title not available (Why is that?)
- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning
- Title not available (Why is that?)
- Amortized random backtracking
- An exercise in transformational programming: Backtracking and Branch-and- Bound
- Efficient data structures for backtrack search SAT solvers
- Resolution versus search: Two strategies for SAT
Uses Software
Recommendations
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)
