A Decision-Making Procedure for Resolution-Based SAT-Solvers

DOI10.1007/978-3-540-79719-7_11zbMath1138.68539OpenAlexW1553616831MaRDI QIDQ3502699

Eugene Goldberg

Publication date: 27 May 2008

Published in: Theory and Applications of Satisfiability Testing – SAT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79719-7_11

Mathematics Subject Classification ID

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

Related Items

An overview of parallel SAT solving, Boundary Points and Resolution

Uses Software

• MiniSat
• UnitWalk
• SATO
• Chaff
• BerkMin

Cites Work

• Solving satisfiability in less than \(2^ n\) steps
• Boosting complete techniques thanks to local search methods
• A constraint-based approach to narrow search trees for satisfiability
• UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
• Autarky pruning in propositional model elimination reduces failure redundancy
• Investigations on autark assignments
• BerkMin: A fast and robust SAT-solver
• GRASP: a search algorithm for propositional satisfiability
• SATO: An efficient propositional prover
• Theory and Applications of Satisfiability Testing
• A machine program for theorem-proving
• Determinization of Resolution by an Algorithm Operating on Complete Assignments
• Unnamed Item