Sökning: onr:"swepub:oai:DiVA.org:kth-214647" >
CNFgen :
CNFgen : A generator of crafted benchmarks
-
Lauria, M. (författare)
-
- Elffers, Jan (författare)
- KTH,Teoretisk datalogi, TCS
-
- Nordström, Jakob (författare)
- KTH,Teoretisk datalogi, TCS
-
visa fler...
-
- Vinyals, Marc (författare)
- KTH,Teoretisk datalogi, TCS
-
visa färre...
-
(creator_code:org_t)
- 2017-08-09
- 2017
- Engelska.
-
Ingår i: 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017. - Cham : Springer. - 9783319662626 ; , s. 464-473
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas