86 search results - page 7 / 18 » The state of SAT |
SAT
2010
Springer
13 years 6 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
ICCAD
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper addresses SAT-based Unbounded Model Checking based on Craig Interpolants. This recently introduced methodology is often able to outperform BDDs and other SAT-based tech...
SAT
2009
Springer
14 years 2 months ago
2009
Springer
Induced (chord-free) cycles in binary hypercubes have many applications in computer science. The state of the art for computing such cycles relies on genetic algorithms, which are,...
MTV
2003
IEEE
14 years 24 days ago
2003
IEEE
Bounded Model Checking (BMC) techniques have been used for formal hardware verification, with the help of tools such as GRASP (Generic search Algorithm for Satisfiability Proble...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...