16 search results - page 3 / 4 » MFSAT: A SAT Solver Using Multi-Flip Local Search |
SAT
2009
Springer
14 years 24 days 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...
ICTAI
2009
IEEE
14 years 28 days ago
2009
IEEE
In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning ...
CP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
ICTAI
2006
IEEE
14 years 9 days 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
2005
Springer
13 years 11 months ago
2005
Springer
Solvers for Quantified Boolean Formulae (QBF) use many analogues of technique from SAT. A significant amount of work has gone into extending conflict based techniques such as co...