A dynamic restart strategy for solving SAT problem

DOI10.3969/J.ISSN.1005-3026.2014.07.006MaRDI QIDQ5498062zbMATH OpenFDO

Authors Ying Guo, Changsheng Zhang, Bin Zhang

Publication date 11 February 2015

Full work available at URL https://doi.org/10.3969/J.ISSN.1005-3026.2014.07.006

zbMATH Keywords

conflict decision levelheuristicpropositional satisfiability problemrestart strategy

Mathematics Subject Classification ID

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

Recommendations

• Adaptive Restart Strategies for Conflict Driven SAT Solvers
• Local Restarts
• Reusing the assignment trail in CDCL solvers
• Between restarts and backjumps
• Machine learning-based restart policy for CDCL SAT solvers

Cited in

(9)

• Machine learning-based restart policy for CDCL SAT solvers
• Reusing the assignment trail in CDCL solvers
• Extreme cases in SAT problems
• Between restarts and backjumps
• Reducing chaos in SAT-like search: finding solutions close to a given one
• Adaptive Restart Strategies for Conflict Driven SAT Solvers
• Online Estimation of SAT Solving Runtime
• Local Restarts
• A bit-encoding phase selection strategy for satisfiability solvers

This page was built for publication: A dynamic restart strategy for solving SAT problem

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