Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ACTA
2007
92views more  ACTA 2007»
10 years 2 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
AAAI
2008
10 years 5 months ago
The Parameterized Complexity of Global Constraints
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propag...
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich...
SAT
2004
Springer
101views Hardware» more  SAT 2004»
10 years 8 months ago
Detecting Backdoor Sets with Respect to Horn and Binary Clauses
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satis´Čüability problem (SAT) with respect to the polynomially solvable classes ...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
ICTAI
2006
IEEE
10 years 8 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...
books