scientific article; zbMATH DE number 2084740
From MaRDI portal
Publication:4475671
Recommendations
- Complete Boolean satisfiability solving algorithms based on local search
- The complexity of Boolean constraint satisfaction local search problems
- Theory and Applications of Satisfiability Testing
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
- Local search for Boolean satisfiability with configuration checking and subscore
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- Using stochastic local search to solve quantified Boolean formulae
- scientific article; zbMATH DE number 1903342
- scientific article; zbMATH DE number 2090309
Cited in
(12)- From Idempotent Generalized Boolean Assignments to Multi-bit Search
- Theory and Applications of Satisfiability Testing
- Worst-case study of local search for MAX-\(k\)-SAT.
- Heuristic-based backtracking relaxation for propositional satisfiability
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- Exploiting relaxation in local search for LABS
- A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
- A randomized satisfiability procedure for arithmetic and uninterpreted function symbols.
- The Relation Between Complete and Incomplete Search
- scientific article; zbMATH DE number 1630006 (Why is no real title available?)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
- Complete Boolean satisfiability solving algorithms based on local search
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4475671)
