SAT and SMT are still resolution: questions and challenges

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

Authors: 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

Recommendations

• Challenges in Satisfiability Modulo Theories
• On tackling the limits of resolution in SAT solving
• Present and Future of Practical SAT Solving
• From Propositional Satisfiability to Satisfiability Modulo Theories
• Propositional SAT solving

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)