Off the Trail: Re-examining the CDCL Algorithm

DOI10.1007/978-3-642-31612-8_4MaRDI QIDQ2843320zbMATH OpenOpenAlexFDO

Authors Alexandra Goultiaeva, Fahiem Bacchus

Publication date 12 August 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-31612-8_4

Mathematics Subject Classification ID

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

Recommendations

• Reusing the assignment trail in CDCL solvers
• Speeding up the search algorithm for the best differential and best linear trails
• Beyond the BEST theorem: fast assessment of Eulerian trails
• scientific article; zbMATH DE number 1189326
• Boosting local search thanks to \textsc{cdcl}
• Deconstructing the Zeilberger algorithm^†
• A New Insight into the Coffman–Graham Algorithm
• Partial backtracking in CDCL solvers
• scientific article; zbMATH DE number 885404
• Clustering effect of iterative differential and linear trails

Cited in

(8)

• Chronological backtracking
• On CDCL-based proof systems with the ordered decision strategy
• Reusing the assignment trail in CDCL solvers
• Trade-offs between time and memory in a tighter model of CDCL SAT solvers
• Between SAT and UNSAT: the fundamental difference in CDCL SAT
• Boosting local search thanks to \textsc{cdcl}
• On CDCL-Based Proof Systems with the Ordered Decision Strategy
• Better Decision Heuristics in CDCL through Local Search and Target Phases

Describes a project that uses

Uses Software

• DepQBF

This page was built for publication: Off the Trail: Re-examining the CDCL Algorithm

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