QBFFam: A Tool for Generating QBF Families from Proof Complexity

Olaf Beyersdorff; Luca Pulina; Martina Seidl; Ankit Shukla

doi:10.1007/978-3-030-80223-3_3

QBFFam: A Tool for Generating QBF Families from Proof Complexity

Olaf Beyersdorff
, Luca Pulina
, Martina Seidl
, Ankit Shukla

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

Original language	English
Title of host publication	Theory and Applications of Satisfiability Testing – SAT 2021 - 24th International Conference, 2021, Proceedings
Editors	Chu-Min Li, Felip Manyà
Publisher	Springer
Pages	21-29
Number of pages	9
Volume	12831
ISBN (Print)	9783030802226
DOIs	https://doi.org/10.1007/978-3-030-80223-3_3
Publication status	Published - 2021

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12831 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Fields of science

101013 Mathematical logic
102 Computer Sciences
102001 Artificial intelligence
102011 Formal languages
102022 Software development
102030 Semantic technologies
102031 Theoretical computer science
603109 Logic

JKU Focus areas

Digital Transformation

Access to Document

10.1007/978-3-030-80223-3_3

Cite this

Beyersdorff, O., Pulina, L., Seidl, M., & Shukla, A. (2021). QBFFam: A Tool for Generating QBF Families from Proof Complexity. In C.-M. Li, & F. Manyà (Eds.), Theory and Applications of Satisfiability Testing – SAT 2021 - 24th International Conference, 2021, Proceedings (Vol. 12831, pp. 21-29). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12831 LNCS). Springer. https://doi.org/10.1007/978-3-030-80223-3_3

Beyersdorff, Olaf ; Pulina, Luca ; Seidl, Martina et al. / QBFFam: A Tool for Generating QBF Families from Proof Complexity. Theory and Applications of Satisfiability Testing – SAT 2021 - 24th International Conference, 2021, Proceedings. editor / Chu-Min Li ; Felip Manyà. Vol. 12831 Springer, 2021. pp. 21-29 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{23b3263371134c33916b137d0de1772e,

title = "QBFFam: A Tool for Generating QBF Families from Proof Complexity",

author = "Olaf Beyersdorff and Luca Pulina and Martina Seidl and Ankit Shukla",

year = "2021",

doi = "10.1007/978-3-030-80223-3\_3",

language = "English",

isbn = "9783030802226",

volume = "12831",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "21--29",

editor = "Chu-Min Li and Felip Many{\`a}",

booktitle = "Theory and Applications of Satisfiability Testing – SAT 2021 - 24th International Conference, 2021, Proceedings",

}

Beyersdorff, O, Pulina, L, Seidl, M & Shukla, A 2021, QBFFam: A Tool for Generating QBF Families from Proof Complexity. in C-M Li & F Manyà (eds), Theory and Applications of Satisfiability Testing – SAT 2021 - 24th International Conference, 2021, Proceedings. vol. 12831, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12831 LNCS, Springer, pp. 21-29. https://doi.org/10.1007/978-3-030-80223-3_3

QBFFam: A Tool for Generating QBF Families from Proof Complexity. / Beyersdorff, Olaf; Pulina, Luca; Seidl, Martina et al.
Theory and Applications of Satisfiability Testing – SAT 2021 - 24th International Conference, 2021, Proceedings. ed. / Chu-Min Li; Felip Manyà. Vol. 12831 Springer, 2021. p. 21-29 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12831 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

TY - GEN

T1 - QBFFam: A Tool for Generating QBF Families from Proof Complexity

AU - Beyersdorff, Olaf

AU - Pulina, Luca

AU - Seidl, Martina

AU - Shukla, Ankit

PY - 2021

Y1 - 2021

UR - https://www.scopus.com/pages/publications/85112221247

U2 - 10.1007/978-3-030-80223-3_3

DO - 10.1007/978-3-030-80223-3_3

M3 - Conference proceedings

SN - 9783030802226

VL - 12831

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 21

EP - 29

BT - Theory and Applications of Satisfiability Testing – SAT 2021 - 24th International Conference, 2021, Proceedings

A2 - Li, Chu-Min

A2 - Manyà, Felip

PB - Springer

ER -

Beyersdorff O, Pulina L, Seidl M, Shukla A. QBFFam: A Tool for Generating QBF Families from Proof Complexity. In Li CM, Manyà F, editors, Theory and Applications of Satisfiability Testing – SAT 2021 - 24th International Conference, 2021, Proceedings. Vol. 12831. Springer. 2021. p. 21-29. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-80223-3_3

QBFFam: A Tool for Generating QBF Families from Proof Complexity

Publication series

Fields of science

JKU Focus areas

Access to Document

Other files and links

Cite this