21 search results - page 3 / 5 » What Is a Real-World SAT Instance |
SAT
2009
Springer
14 years 2 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
MC
2003
13 years 8 months ago
2003
Social navigation is the alternative way of looking upon navigation in the virtual world: e g instead of navigating the web by maps and hierarchies and search engines, you would n...
ICTAI
2006
IEEE
14 years 1 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...
SAT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. On the theoreti...
IEEEHPCS
2010
13 years 6 months ago
2010
Abstract. In this paper, we explore the two well-known principles of diversification and intensification in portfolio-based parallel SAT solving. These dual concepts play an impo...