A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
<|reference_start|>A Scalable Algorithm for Minimal Unsatisfiable Core Extraction: 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.<|reference_end|>
@article{dershowitz2006a,
    title={A Scalable Algorithm for Minimal Unsatisfiable Core Extraction},
    author={Nachum Dershowitz, Ziyad Hanna and Alexander Nadel},
    journal={Proceedings of the 9th International Conference Theory and
  Applications of Satisfiability Testing (SAT 2006), Lecture Notes in Computer
  Science, volume 4121, Springer-Verlag, Berlin, pp. 36-41},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0605085},
    primaryClass={cs.LO}
}