Creating Industrial-Like SAT Instances by Clustering and Reconstruction - (Poster Presentation)

For the optimization of SAT solvers, it is crucial that a solver can be trained on a preferably large number of instances for general or domain specific problems. Especially for domain specific problems the set of available instances can be insufficiently small. In our approach we built large sets of instances by recombining several small snippets of different instances of a particular domain. Also the fuzzer utility [3] builds industrial-like SAT instances by combining smaller pieces. However, these pieces are a combination of randomly created circuits and are not derived from an existing pool of instances. In Ansotegui [1] random pseudo-industrial instances are created in a more formal way.

[1]  Yoav Shoham,et al.  Understanding Random SAT: Beyond the Clauses-to-Variables Ratio , 2004, CP.

[2]  Mark Wallace,et al.  Principles and Practice of Constraint Programming – CP 2004 , 2004, Lecture Notes in Computer Science.

[3]  Ulrik Brandes,et al.  On Modularity Clustering , 2008, IEEE Transactions on Knowledge and Data Engineering.

[4]  Armin Biere,et al.  Automated Testing and Debugging of SAT and QBF Solvers , 2010, SAT.

[5]  Ofer Strichman,et al.  Theory and Applications of Satisfiability Testing – SAT 2010 , 2010, Lecture Notes in Computer Science.

[6]  Maria Luisa Bonet,et al.  Towards Industrial-Like Random SAT Instances , 2009, IJCAI.