100 search results - page 2 / 20 » sat 2005 |
JSAT
2006
13 years 8 months ago
2006
An analysis of the SAT 2005 sub-competition on random instances is given. This year this (sub-)competition set-up was geared to establish a basic setting, focusing on the instance...
SAT
2005
Springer
14 years 2 months ago
2005
Springer
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
AMAI
2005
Springer
13 years 8 months ago
2005
Springer
SAT
2005
Springer
14 years 2 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
CLEF
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Esfinge is a general domain Portuguese question answering system. It tries to apply simple techniques to large amounts of text. Esfinge participated last year in the mono...