21 search results - page 4 / 5 » Guided Local Search for Solving SAT and Weighted MAX-SAT Pro... |
SAT
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
TIME
2002
IEEE
13 years 10 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
EPIA
1997
Springer
13 years 9 months ago
1997
Springer
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
CP
2006
Springer
13 years 9 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
MICAI
2004
Springer
13 years 11 months ago
2004
Springer
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...