FMSD
2010
13 years 9 months ago
2010
Abstract The 2009 CAV (Computer-Aided Verification) award was presented to seven individuals who made major advances in creating high-performance Boolean satisfiability solvers. ...
ICAI
2003
14 years 8 days ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
CAV
2000
Springer
14 years 3 months ago
2000
Springer
Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion . . . . . . . . . . . . . . . . . . . . . . . . . . 1 A. Pnueli Invited Address...
TACAS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Many important problems in bioinformatics and genetics require analyses that are NP-complete. For example, one of the basic problems facing researchers that analyze pedig...