CDCL(⊕) generalizes CDCL to XNF formulas with linear clauses, polynomially simulates Res(⊕), and is implemented in Xorcle which outperforms standard solvers on selected XNF benchmarks.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
Kani is a model checker that compiles Rust proof harnesses from MIR to CBMC for bounded verification of safety properties and supports contracts to extend checks to unbounded correctness.
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.
citing papers explorer
-
Logic-Constrained Shortest Paths for Flight Planning
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.