Solving Boolean satisfiability using local search guided by unit clause elimination

DOI10.1007/3-540-45578-7_48MaRDI QIDQ4475671zbMATH OpenFDO

Authors Edward A. Hirsch, Arist Kojevnikov

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390605.htm

zbMATH Keywords

Boolean satisfiabilityempirical evaluationlocal search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

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
• The quest for efficient Boolean satisfiability solvers
• The quest for efficient Boolean satisfiability solvers

Cited in

(12)

• Worst-case study of local search for MAX-\(k\)-SAT.
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
• Complete Boolean satisfiability solving algorithms based on local search
• Exploiting relaxation in local search for LABS
• A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
• Solving the satisfiability problem through Boolean networks
• The Relation Between Complete and Incomplete Search
• From Idempotent Generalized Boolean Assignments to Multi-bit Search
• Theory and Applications of Satisfiability Testing
• A randomized satisfiability procedure for arithmetic and uninterpreted function symbols.
• Heuristic-based backtracking relaxation for propositional satisfiability

This page was built for publication: Solving Boolean satisfiability using local search guided by unit clause elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4475671)