Abstract
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.
This work was supported by the DFG-SPP 1307, project StrAlEnSAT, and by the BMBF, projects SANITAS (grant 01M3088C) and RESCAR2.0 (grant 01M3195E).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ansótegui, C., Bonet, M.L., Levy, J.: Towards Industrial-Like Random SAT Instances. In: IJCAI, pp. 387–392 (2009)
Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: On Modularity Clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172–188 (2008)
Brummayer, R., Lonsing, F., Biere, A.: Automated Testing and Debugging of SAT and QBF Solvers. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 44–57. Springer, Heidelberg (2010)
Nudelman, E., Leyton-Brown, K., Hoos, H.H., Devkar, A., Shoham, Y.: Understanding Random SAT: Beyond the Clauses-to-Variables Ratio. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 438–452. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burg, S., Kottler, S., Kaufmann, M. (2012). Creating Industrial-Like SAT Instances by Clustering and Reconstruction. In: Cimatti, A., Sebastiani, R. (eds) Theory and Applications of Satisfiability Testing – SAT 2012. SAT 2012. Lecture Notes in Computer Science, vol 7317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31612-8_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-31612-8_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31611-1
Online ISBN: 978-3-642-31612-8
eBook Packages: Computer ScienceComputer Science (R0)