CNFgen: A generator of crafted benchmarks
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
We present CNFgen, a generator of combinatorial benchmarks in DIMACS and OPB format. The proof complexity literature is a rich source not only of hard instances but also of instances that are theoretically easy but “extremal” in different ways, and therefore of potential interest in the context of SAT solving. Since most of these formulas appear not to be very well known in the SAT community, however, we propose CNFgen as a resource to make them readily available for solver development and evaluation. Many formulas studied in proof complexity are based on graphs, and CNFgen is also able to generate, parse and do basic manipulation of such objects. Furthermore, it includes a library cnfformula giving access to the functionality of CNFgen to Python programs.
Original language | English |
---|---|
Title of host publication | Theory and Applications of Satisfiability Testing – SAT 2017 - 20th International Conference, Proceedings |
Editors | Serge Gaspers, Toby Walsh |
Number of pages | 10 |
Publisher | Springer Verlag, |
Publication date | 2017 |
Pages | 464-473 |
ISBN (Print) | 9783319662626 |
DOIs | |
Publication status | Published - 2017 |
Externally published | Yes |
Event | 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017 - Melbourne, Australia Duration: 28 Aug 2017 → 1 Sep 2017 |
Conference
Conference | 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017 |
---|---|
Land | Australia |
By | Melbourne |
Periode | 28/08/2017 → 01/09/2017 |
Sponsor | Association for Constraint Programming, Association for Logic Programming, CSIRO Data61, et al., Monash University, University of Melbourne |
Series | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 10491 LNCS |
ISSN | 0302-9743 |
ID: 251868091