2 search results - page 1 / 1 » A Branching Heuristics for Quantified Renamable Horn Formula... |
SAT
2005
Springer
13 years 10 months ago
2005
Springer
ICTAI
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...