Sciweavers

3 search results - page 1 / 1
» A fast counterexample minimization approach with refutation ...
Sort
View
ASPDAC
2005
ACM
99views Hardware» more  ASPDAC 2005»
13 years 6 months ago
A fast counterexample minimization approach with refutation analysis and incremental SAT
- It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
ShengYu Shen, Ying Qin, Sikun Li
DATE
2005
IEEE
93views Hardware» more  DATE 2005»
13 years 10 months ago
A Faster Counterexample Minimization Algorithm Based on Refutation Analysis
It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective counterexample minimi...
ShengYu Shen, Ying Qin, Sikun Li
VMCAI
2005
Springer
13 years 10 months ago
Minimizing Counterexample with Unit Core Extraction and Incremental SAT
Abstract. It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample min...
ShengYu Shen, Ying Qin, Sikun Li