295 search results - page 18 / 59 » SAT, SMT and Applications |
ITP
2010
14 years 10 months ago
2010
MJ
2007
14 years 11 months ago
2007
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
124
click to vote
ICCAD
2001
IEEE
15 years 8 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
ICTAI
2008
IEEE
15 years 6 months ago
2008
IEEE
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
103
click to vote
DATE
2000
IEEE
15 years 4 months ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...