Sciweavers

2 search results - page 1 / 1
» A Branching Heuristics for Quantified Renamable Horn Formula...
Sort
View
SAT
2005
Springer
117views Hardware» more  SAT 2005»
14 years 4 months ago
A Branching Heuristics for Quantified Renamable Horn Formulas
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...
ICTAI
2006
IEEE
14 years 4 months ago
Computing Horn Strong Backdoor Sets Thanks to Local Search
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...
Lionel Paris, Richard Ostrowski, Pierre Siegel, La...