Graph backtracking generalizes CDCL backtracking via implication graphs and weight functions, is sound and complete, and shows fewer propagations in the NapSAT implementation.
21 Coutelier Robin
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Presents a dynamic partitioning parallel SMT framework with core-guided pruning and backbone detection that outperforms sequential Z3 and prior parallel solvers on SMT-COMP 2025 benchmarks across six logics.
citing papers explorer
-
Generalizing CDCL with Graph Backtracking
Graph backtracking generalizes CDCL backtracking via implication graphs and weight functions, is sound and complete, and shows fewer propagations in the NapSAT implementation.
-
Parallel SMT Solving via Dynamic Partitioning, Core-Guided Pruning, and Online Backbone Detection
Presents a dynamic partitioning parallel SMT framework with core-guided pruning and backbone detection that outperforms sequential Z3 and prior parallel solvers on SMT-COMP 2025 benchmarks across six logics.