Creating industrial-like SAT instances by clustering and reconstruction

Authors:
Sebastian Burg;Stephan Kottler;Michael Kaufmann
Affiliations:
FZI, Karlsruhe, Germany, University of Tübingen, Germany;University of Tübingen, Germany;University of Tübingen, Germany
Venue:
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Year:
2012

Citing 3
Cited 0

On Modularity Clustering

IEEE Transactions on Knowledge and Data Engineering
Towards industrial-like random SAT instances

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Automated testing and debugging of SAT and QBF solvers

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

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.