Theory and Applications of Satisfiability Testing – SAT 2021
Book title Buchtitel
Theory and Applications of Satisfiability Testing – SAT 2021
Publisher Herausgeber
LNCS / Springer
Place of publishing Erscheinungsort
12831
Series Schriftenreihe
Lecture Notes in Computer Science
Results 1-5 of 5 (Search time: 0.001 seconds).
| Preview | Authors / Editors | Title | Type | Issue Date | |
|---|---|---|---|---|---|
| 1 | Reichl, Franz-Xaver ; Slivovsky, Friedrich ; Szeider, Stefan | Certified DQBF Solving by Definition Extraction | Konferenzbeitrag Inproceedings  | 2021 | |
| 2 | Blinkhorn, Joshua ; Peitl, Tomáš ; Slivovsky, Friedrich | Davis and Putnam Meet Henkin: Solving DQBF with Resolution | Konferenzbeitrag Inproceedings | 2021 | |
| 3 | Chew, Leroy | Hardness and Optimality in QBF Proof Systems Modulo NP | Konferenzbeitrag Inproceedings | 2021 | |
| 4 | Hermann, Miki ; Salzer, Gernot | MCP: Capturing Big Data by Satisfiability (Tool Description) | Konferenzbeitrag Inproceedings | 2021 | |
| 5 | Mengel, Stefan ; Slivovsky, Friedrich | Proof Complexity of Symbolic QBF Reasoning | Konferenzbeitrag Inproceedings | 2021 |