Sciweavers

101 search results - page 2 / 21
» sat 2009
Sort
View
SARA
2009
Springer
13 years 11 months ago
A New Formula Rewriting by Reasoning on a Graphical Representation of SAT Instances
In this paper, we propose a new approach for solving the SAT problem. This approach consists in representing SAT instances thanks to an undirected graph issued from a polynomial t...
Philippe Jégou, Lionel Paris
SAT
2009
Springer
94views Hardware» more  SAT 2009»
13 years 11 months ago
Sequential Encodings from Max-CSP into Partial Max-SAT
Abstract. We define new encodings from Max-CSP into Partial MaxSAT which are obtained by modelling the at-most-one condition with the sequential SAT encoding of the cardinality co...
Josep Argelich, Alba Cabiscol, Inês Lynce, F...
SAT
2010
Springer
127views Hardware» more  SAT 2010»
13 years 2 months ago
Symmetry and Satisfiability: An Update
Abstract. The past few years have seen significant progress in algorithms and heuristics for both SAT and symmetry detection. Additionally, the thesis that some of SAT's intra...
Hadi Katebi, Karem A. Sakallah, Igor L. Markov
CCIA
2009
Springer
13 years 2 months ago
On Solving MaxSAT Through SAT
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
SAT
2009
Springer
108views Hardware» more  SAT 2009»
13 years 11 months ago
On-the-Fly Clause Improvement
Most current propositional SAT solvers apply resolution at various stages to derive new clauses or simplify existing ones. The former happens during conflict analysis, while the l...
HyoJung Han, Fabio Somenzi