SAT and SMT Are Still Resolution: Questions and Challenges

DOI10.1007/978-3-642-31365-3_3zbMATH Open1358.68260OpenAlexW49465025MaRDI QIDQ2908473FDOQ2908473

Robert Nieuwenhuis

Publication date: 5 September 2012

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31365-3_3

Mathematics Subject Classification ID

Cited In (1)

• The proof complexity of SMT solvers

This page was built for publication: SAT and SMT Are Still Resolution: Questions and Challenges

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