Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-66263-3_30 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Discrete mathematics,Graph,Programming language,Computer science,Proof complexity,Parsing,Solver,Python (programming language) | Conference | 10491 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.36 |
References | Authors | |
33 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Massimo Lauria | 1 | 122 | 14.73 |
| Jan Elffers | 2 | 12 | 3.17 |
| Jakob Nordström | 3 | 177 | 21.76 |
| Marc Vinyals | 4 | 28 | 4.91 |