21 search results - page 3 / 5 » Guided Local Search for Solving SAT and Weighted MAX-SAT Pro... |
CP
2005
Springer
13 years 10 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...
SAT
2010
Springer
13 years 3 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
FLAIRS
2007
13 years 7 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
AUSAI
2007
Springer
13 years 9 months ago
2007
Springer
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
JSAT
2008
13 years 5 months ago
2008
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...