29 search results - page 5 / 6 » Complete Local Search for Propositional Satisfiability |
140
click to vote
SAT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
158
click to vote
FLAIRS
2004
15 years 6 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
156
click to vote
EPIA
1997
Springer
15 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...
157
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
173
click to vote
CP
2006
Springer
15 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...