8 search results - page 2 / 2 » Solving QBF by Combining Conjunctive and Disjunctive Normal ... |
SAT
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Preprocessing has proven important in enabling efficient Boolean satisfiability (SAT) solving. For many real application scenarios of SAT it is important to be able to ...
DATAMINE
2007
13 years 5 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
TACAS
2010
Springer
14 years 3 days ago
2010
Springer
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...