The task of extracting an unsatisfiable core for a given Boolean formula has been finding more and more applications in recent years. The only existing approach that scales well for large real-world formulas exploits the ability of modern SAT solvers to produce resolution refutations. However, the resulting unsatisfiable cores are suboptimal. We propose a new algorithm for minimal unsatisfiable core extraction, based on a deeper exploration of resolution-refutation properties. We provide experimental results on formal verification benchmarks confirming that our algorithm finds smaller cores than suboptimal algorithms; and that it runs faster than those algorithms that guarantee minimality of the core.
A scalable algorithm REF , adopting a deeper exploration of resolution refutation, is proposed for minimal unsatisfiable subformulas extraction.
A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
ArXiv
ArXiv
Computer Science Mathematics