19 search results - page 4 / 4 » A Restriction of Extended Resolution for Clause Learning SAT... |
JSAT
2008
13 years 5 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...
ICTAI
2009
IEEE
14 years 2 days 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 ...
LPAR
2010
Springer
13 years 3 months ago
2010
Springer
In this paper we introduce an extension of propositional logic that allows clauses to be weighted with values from a generic semiring. The main interest of this extension is that ...
SAT
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...