A scalable algorithm for minimal unsatisfiable core extraction
Theory and Applications of Satisfiability Testing-SAT 2006: 9th International …, 2006•Springer
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 more complete version of this paper may be found at arXiv. org/pdf/cs. LO/0605085.)
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 more complete version of this paper may be found at arXiv. org/pdf/cs. LO/0605085.)
Abstract
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 more complete version of this paper may be found at arXiv.org/pdf/cs.LO/0605085.)
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果