Lazy reimplication in chronological backtracking

DOI10.4230/LIPICS.SAT.2024.9MaRDI QIDQ6864436zbMATH OpenFDO

Authors Mathias Fleury, Laura Kovács

Publication date 3 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SAT.2024.9

zbMATH Keywords

CDCLchronological backtrackinginvariantswatcher lists

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• Adaptive Restart Strategies for Conflict Driven SAT Solvers
• Backing backtracking
• Cache conscious data structures for Boolean satisfiability solvers
• Chronological backtracking
• GRASP: a search algorithm for propositional satisfiability
• Handbook of satisfiability. In 2 parts
• Introducing Intel\(\circledR\) SAT solver
• SATLIB: An online resource for research on SAT
• Trail saving on backtrack

This page was built for publication: Lazy reimplication in chronological backtracking

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