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

Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

Originalsprache	Englisch
Titel	Theory and Applications of Satisfiability Testing – SAT 2021 - 24th International Conference, 2021, Proceedings
Herausgeber*innen	Chu-Min Li, Felip Manyà
Verlag	Springer
Seiten	21-29
Seitenumfang	9
Band	12831
ISBN (Print)	9783030802226
DOIs	https://doi.org/10.1007/978-3-030-80223-3_3
Publikationsstatus	Veröffentlicht - 2021

Publikationsreihe

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

Wissenschaftszweige

101013 Mathematische Logik
102 Informatik
102001 Artificial Intelligence
102011 Formale Sprachen
102022 Softwareentwicklung
102030 Semantische Technologien
102031 Theoretische Informatik
603109 Logik

JKU-Schwerpunkte

Digital Transformation

Zugriff auf Dokument

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

Andere Dateien und Links

Verknüpfung zur Publikation in Scopus

Dieses zitieren

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à (Hrsg.), Theory and Applications of Satisfiability Testing – SAT 2021 - 24th International Conference, 2021, Proceedings (Band 12831, S. 21-29). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 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. Hrsg. / Chu-Min Li ; Felip Manyà. Band 12831 Springer, 2021. S. 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à (Hrsg.), Theory and Applications of Satisfiability Testing – SAT 2021 - 24th International Conference, 2021, Proceedings. Bd. 12831, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bd. 12831 LNCS, Springer, S. 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. Hrsg. / Chu-Min Li; Felip Manyà. Band 12831 Springer, 2021. S. 21-29 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 12831 LNCS).

Publikation: Beitrag in Buch/Bericht/Konferenzband › Konferenzbeitrag › Begutachtung

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, Hrsg., Theory and Applications of Satisfiability Testing – SAT 2021 - 24th International Conference, 2021, Proceedings. Band 12831. Springer. 2021. S. 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