A bit-encoding phase selection strategy for satisfiability solvers

DOI10.1007/978-3-319-06089-7_11MaRDI QIDQ5410641zbMATH OpenOpenAlexFDO

Authors Jing-Chao Chen

Publication date 16 April 2014

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

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

zbMATH Keywords

conflict-driven DPLLphase selection for SAT solversSAT solver

Mathematics Subject Classification ID

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

Recommendations

• A dynamic restart strategy for solving SAT problem
• Advances in Artificial Intelligence
• Theory and Applications of Satisfiability Testing
• Extreme cases in SAT problems
• BerkMin: A fast and robust SAT-solver

Cited in

(3)

• Constraint satisfaction through GBP-guided deliberate bit flipping
• Extreme cases in SAT problems
• Using Community Structure to Detect Relevant Learnt Clauses

Describes a project that uses

Uses Software

• Chaff

This page was built for publication: A bit-encoding phase selection strategy for satisfiability solvers

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