Partial backtracking in CDCL solvers

DOI10.1007/978-3-642-45221-5_33MaRDI QIDQ2870149zbMATH OpenOpenAlexFDO

Authors Chuan Jiang, Ting Zhang

Publication date 17 January 2014

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45221-5_33

zbMATH Keywords

backtrackingconflict-driven conflict learningsatisfiability

Mathematics Subject Classification ID

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

Recommendations

• Backtracking tactics in the backtrack method for SAT
• Backing backtracking
• Progress in Artificial Intelligence
• Heuristic-based backtracking relaxation for propositional satisfiability
• An overview of backtrack search satisfiability algorithms

Cited in

(4)

• Backtracking tactics in the backtrack method for SAT
• Chronological backtracking
• Off the Trail: Re-examining the CDCL Algorithm
• scientific article; zbMATH DE number 1086900 (Why is no real title available?)

Describes a project that uses

Uses Software

• Glucose
• Chaff
• MiniSat

This page was built for publication: Partial backtracking in CDCL solvers

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