On CDCL-based proof systems with the ordered decision strategy

DOI10.1007/978-3-030-51825-7_12OpenAlexW3046736683MaRDI QIDQ2661344

Nathan Mull, Alexander A. Razborov, Shuo Pang

Publication date: 7 April 2021

Full work available at URL: https://arxiv.org/abs/1909.04135

Mathematics Subject Classification ID

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

Related Items (3)

On CDCL-Based Proof Systems with the Ordered Decision Strategy ⋮ Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution ⋮ Propositional proof complexity

This page was built for publication: On CDCL-based proof systems with the ordered decision strategy