Sciweavers

10 search results - page 2 / 2
» Integration of supercubing and learning in a SAT solver
Sort
View
DATE
2005
IEEE
150views Hardware» more  DATE 2005»
13 years 10 months ago
Pueblo: A Modern Pseudo-Boolean SAT Solver
This paper introduces a new SAT solver that integrates logicbased reasoning and integer programming methods to systems of CNF and PB constraints. Its novel features include an eff...
Hossein M. Sheini, Karem A. Sakallah
ATS
2009
IEEE
142views Hardware» more  ATS 2009»
13 years 12 months ago
Speeding up SAT-Based ATPG Using Dynamic Clause Activation
Abstract—SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduce...
Stephan Eggersglüß, Daniel Tille, Rolf ...
ICTAI
2009
IEEE
13 years 11 months ago
Learning for Dynamic Assignments Reordering
In this paper a new learning scheme for SAT is proposed. The originality of our approach arises from its ability to achieve clause learning even if no conflict occurs. This clear...
Saïd Jabbour
ICTAI
2009
IEEE
13 years 11 months ago
Learning in Local Search
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 ...
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazu...
ICTAI
2009
IEEE
13 years 11 months ago
Learning for Dynamic Subsumption
This paper presents an original dynamic subsumption technique for Boolean CNF formulae. It exploits simple and sufficient conditions to detect, during conflict analysis, clauses...
Youssef Hamadi, Saïd Jabbour, Lakhdar Sais