104 search results - page 3 / 21 » Hierarchical Hardness Models for SAT |
CATS
2008
13 years 7 months ago
2008
Lazy clause generation is a hybrid SAT and finite domain propagation solver that tries to combine the advantages of both: succinct modelling using finite domains and powerful nogo...
ACRI
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Cellular Automata are a powerful formal model for describing physical and computational processes. Qualitative analysis of Cellular Automata is in general a hard problem....
IAT
2009
IEEE
13 years 10 months ago
2009
IEEE
When intelligent systems reason about complex problems with a large hierarchical classification space it is hard to evaluate system performance. For classification problems, differ...
SARA
2009
Springer
14 years 21 days ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
SAT
2009
Springer
14 years 21 days ago
2009
Springer
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...