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. © 2012 Springer-Verlag.
CITATION STYLE
Burg, S., Kottler, S., & Kaufmann, M. (2012). Creating industrial-like SAT instances by clustering and reconstruction (Poster presentation). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7317 LNCS, pp. 471–472). https://doi.org/10.1007/978-3-642-31612-8_40
Mendeley helps you to discover research relevant for your work.