Sciweavers

13 search results - page 1 / 3
» Longer-Term Memory in Clause Weighting Local Search for SAT
Sort
View
AUSAI
2004
Springer
13 years 9 months ago
Longer-Term Memory in Clause Weighting Local Search for SAT
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
Valnir Ferreira Jr., John Thornton
CP
2008
Springer
13 years 5 months ago
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
Wanxia Wei, Chu Min Li, Harry Zhang
CP
2005
Springer
13 years 9 months ago
Neighbourhood Clause Weight Redistribution in Local Search for SAT
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...
Abdelraouf Ishtaiwi, John Thornton, Abdul Sattar, ...
AUSAI
2003
Springer
13 years 8 months ago
Estimating Problem Metrics for SAT Clause Weighting Local Search
Wayne J. Pullan, Liang Zhao, John Thornton
SAT
2004
Springer
95views Hardware» more  SAT 2004»
13 years 9 months ago
Local Search for Very Large SAT Problems
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
Steven David Prestwich, Colin Quirke