Sciweavers

152 search results - page 1 / 31
» Efficiently Exploiting Dependencies in Local Search for SAT
Sort
View
AAAI
2008
13 years 7 months ago
Efficiently Exploiting Dependencies in Local Search for SAT
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...
Duc Nghia Pham, John Thornton, Abdul Sattar
IJCAI
2007
13 years 6 months ago
Building Structure into Local Search for SAT
Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for m...
Duc Nghia Pham, John Thornton, Abdul Sattar
ECAI
2008
Springer
13 years 6 months ago
Justification-Based Non-Clausal Local Search for SAT
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
Matti Järvisalo, Tommi A. Junttila, Ilkka Nie...
SAT
2007
Springer
107views Hardware» more  SAT 2007»
13 years 11 months ago
Combining Adaptive Noise and Look-Ahead in Local Search for SAT
Abstract. The adaptive noise mechanism was introduced in Novelty+ to automatically adapt noise settings during the search [4]. The local search algorithm G2 WSAT deterministically ...
Chu Min Li, Wanxia Wei, Harry Zhang