90 search results - page 2 / 18 » On the Structure of Industrial SAT Instances |
JAR
2007
13 years 5 months ago
2007
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
SAT
2009
Springer
14 years 4 days ago
2009
Springer
Recent work has shown the value of using unsatisfiable cores to guide maximum satisfiability algorithms (Max-SAT) running on industrial instances [5,9,10,11]. We take this concep...
AAAI
2004
13 years 7 months ago
2004
AAAI
2008
13 years 8 months ago
2008
The search of a precise measure of what hardness of SAT instances means for state-of-the-art solvers is a relevant research question. Among others, the space complexity of treelik...
DDECS
2008
IEEE
14 years 2 days ago
2008
IEEE
— Due to ever increasing design sizes more efficient tools for Automatic Test Pattern Generation (ATPG) are needed. Recently ATPG based on Boolean satisfiability (SAT) has been ...