Formula Caching in DPLL

DOI10.1145/1714450.1714452zbMath1322.68175OpenAlexW2007316622MaRDI QIDQ2947546

Russell Impagliazzo, Nathan Segerlind, Toniann Pitassi, P. W. Beame

Publication date: 24 September 2015

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1714450.1714452

zbMATH Keywords

resolutionsatisfiabilityproof complexity

Mathematics Subject Classification ID

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

Related Items (3)

The state of SAT ⋮ Visualizing SAT instances and runs of the DPLL algorithm ⋮ Implementing Efficient All Solutions SAT Solvers

This page was built for publication: Formula Caching in DPLL