Practical algorithms for unsatisfiability proof and core generation in SAT solvers

DOI10.3233/AIC-2010-0462zbMath1208.68195OpenAlexW2167333876MaRDI QIDQ3568227

Robert Nieuwenhuis, Roberto Asín Achá, Albert Oliveras, Enric Rodríguez-Carbonell

Publication date: 17 June 2010

Published in: AI Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/aic-2010-0462

zbMATH Keywords

unsatisfiable coresSAT proofs

Mathematics Subject Classification ID

Related Items (2)

Propositional SAT Solving ⋮ An overview of parallel SAT solving

Uses Software

• VAMPIRE
• PicoSAT

This page was built for publication: Practical algorithms for unsatisfiability proof and core generation in SAT solvers