50 search results - page 2 / 10 » Building Structure into Local Search for SAT |
79
Voted
AUSAI
2007
Springer
15 years 1 months ago
2007
Springer
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
JSAT
2008
14 years 9 months ago
2008
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
AAAI
2008
14 years 12 months ago
2008
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)...
74
Voted
CP
2005
Springer
15 years 3 months ago
2005
Springer
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...
ICTAI
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning ...