Abstract. The adaptive noise mechanism was introduced in Novelty+ to automatically adapt noise settings during the search [4]. The local search algorithm G 2 W SAT deterministically exploits promising decreasing variables to reduce randomness and consequently the dependence on noise parameters. In this paper, we first integrate the adaptive noise mechanism in G 2 W SAT to obtain an algorithm adaptG 2 W SAT, whose performance suggests that the deterministic exploitation of promising decreasing variables cooperates well with this mechanism. Then, we propose an approach that uses look-ahead for promising decreasing variables to further reinforce this cooperation. We implement this approach in adaptG 2 W SAT, resulting in a new local search alg...
Random k-CNF formulas at the anticipated k-SAT phase-transition point are prototypical hard k-SAT in...
Effective local search methods for finding satisfying assign-ments of CNF formulae exhibit several s...
We introduce the dynamic SAT problem, a generalisation of the satisfiability problem in propositiona...
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local se...
Abstract. One way to design a local search algorithm that is effective on many types of instances is...
Although clause weighting local search algorithms have produced some of the best results on a range ...
It is well known that the performance of a stochastic local search procedure depends upon the setti...
International audienceLocal search algorithms based on the Configuration Checking (CC) strategy have...
Abstract. We introduce a new local search algorithm for satisfiability problems. Usual approaches fo...
Abstract. Although most of the focus in SAT local search has been on search behavior (deciding which...
Traditionally, the propositional satisfiability problem (SAT) was attacked with systematic search al...
It has recently been shown that local search is sur-prisingly good at nding satisfying assignments f...
This paper investigates the necessary features of an effective clause weighting local search algorit...
In Boolean logic, a formula is satisfiable if a variable assignment exists that will make the formul...
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local s...
Random k-CNF formulas at the anticipated k-SAT phase-transition point are prototypical hard k-SAT in...
Effective local search methods for finding satisfying assign-ments of CNF formulae exhibit several s...
We introduce the dynamic SAT problem, a generalisation of the satisfiability problem in propositiona...
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local se...
Abstract. One way to design a local search algorithm that is effective on many types of instances is...
Although clause weighting local search algorithms have produced some of the best results on a range ...
It is well known that the performance of a stochastic local search procedure depends upon the setti...
International audienceLocal search algorithms based on the Configuration Checking (CC) strategy have...
Abstract. We introduce a new local search algorithm for satisfiability problems. Usual approaches fo...
Abstract. Although most of the focus in SAT local search has been on search behavior (deciding which...
Traditionally, the propositional satisfiability problem (SAT) was attacked with systematic search al...
It has recently been shown that local search is sur-prisingly good at nding satisfying assignments f...
This paper investigates the necessary features of an effective clause weighting local search algorit...
In Boolean logic, a formula is satisfiable if a variable assignment exists that will make the formul...
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local s...
Random k-CNF formulas at the anticipated k-SAT phase-transition point are prototypical hard k-SAT in...
Effective local search methods for finding satisfying assign-ments of CNF formulae exhibit several s...
We introduce the dynamic SAT problem, a generalisation of the satisfiability problem in propositiona...