Standard
CNFgen : A generator of crafted benchmarks. / Lauria, Massimo; Elffers, Jan; Nordström, Jakob; Vinyals, Marc.
Theory and Applications of Satisfiability Testing – SAT 2017 - 20th International Conference, Proceedings. red. / Serge Gaspers; Toby Walsh. Springer Verlag, 2017. s. 464-473 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 10491 LNCS).
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
Lauria, M, Elffers, J
, Nordström, J & Vinyals, M 2017,
CNFgen: A generator of crafted benchmarks. i S Gaspers & T Walsh (red),
Theory and Applications of Satisfiability Testing – SAT 2017 - 20th International Conference, Proceedings. Springer Verlag, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), bind 10491 LNCS, s. 464-473, 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, Melbourne, Australien,
28/08/2017.
https://doi.org/10.1007/978-3-319-66263-3_30APA
Lauria, M., Elffers, J.
, Nordström, J., & Vinyals, M. (2017).
CNFgen: A generator of crafted benchmarks. I S. Gaspers, & T. Walsh (red.),
Theory and Applications of Satisfiability Testing – SAT 2017 - 20th International Conference, Proceedings (s. 464-473). Springer Verlag,. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Bind 10491 LNCS
https://doi.org/10.1007/978-3-319-66263-3_30Vancouver
Lauria M, Elffers J
, Nordström J, Vinyals M.
CNFgen: A generator of crafted benchmarks. I Gaspers S, Walsh T, red., Theory and Applications of Satisfiability Testing – SAT 2017 - 20th International Conference, Proceedings. Springer Verlag,. 2017. s. 464-473. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 10491 LNCS).
https://doi.org/10.1007/978-3-319-66263-3_30Author
Lauria, Massimo ; Elffers, Jan ; Nordström, Jakob ; Vinyals, Marc. / CNFgen : A generator of crafted benchmarks. Theory and Applications of Satisfiability Testing – SAT 2017 - 20th International Conference, Proceedings. red. / Serge Gaspers ; Toby Walsh. Springer Verlag, 2017. s. 464-473 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 10491 LNCS).
Bibtex
@inproceedings{c5ac16f4a11a462aa67e888a69cc73a1,
title = "CNFgen: A generator of crafted benchmarks",
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.",
author = "Massimo Lauria and Jan Elffers and Jakob Nordstr{\"o}m and Marc Vinyals",
year = "2017",
doi = "10.1007/978-3-319-66263-3_30",
language = "English",
isbn = "9783319662626",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag,",
pages = "464--473",
editor = "Serge Gaspers and Toby Walsh",
booktitle = "Theory and Applications of Satisfiability Testing – SAT 2017 - 20th International Conference, Proceedings",
note = "20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017 ; Conference date: 28-08-2017 Through 01-09-2017",
}
RIS
TY - GEN
T1 - CNFgen
T2 - 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017
AU - Lauria, Massimo
AU - Elffers, Jan
AU - Nordström, Jakob
AU - Vinyals, Marc
PY - 2017
Y1 - 2017
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85028695687&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-66263-3_30
DO - 10.1007/978-3-319-66263-3_30
M3 - Article in proceedings
AN - SCOPUS:85028695687
SN - 9783319662626
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 464
EP - 473
BT - Theory and Applications of Satisfiability Testing – SAT 2017 - 20th International Conference, Proceedings
A2 - Gaspers, Serge
A2 - Walsh, Toby
PB - Springer Verlag,
Y2 - 28 August 2017 through 1 September 2017
ER -
