Theory and Applications of Satisfiability Testing – SAT 2020
Book title Buchtitel
Theory and Applications of Satisfiability Testing – SAT 2020
Publisher Herausgeber
LNCS
Place of publishing Erscheinungsort
12178
Series Schriftenreihe
Lecture Notes in Computer Science
Results 1-4 of 4 (Search time: 0.002 seconds).
| Preview | Authors / Editors | Title | Type | Issue Date | |
|---|---|---|---|---|---|
| 1 | Slivovsky, Friedrich ; Szeider, Stefan | A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth | Konferenzbeitrag Inproceedings  | 2020 | |
| 2 | Schlaipfer, Matthias ; Slivovsky, Friedrich ; Weissenbacher, Georg ; Zuleger, Florian | Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness | Konferenzbeitrag Inproceedings | 2020 | |
| 3 | Shukla, Ankit ; Slivovsky, Friedrich ; Szeider, Stefan | Short Q-Resolution Proofs with Homomorphisms | Konferenzbeitrag Inproceedings | 2020 | |
| 4 | Hecher, Markus ; Thier, Patrick ; Woltran, Stefan | Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology | Konferenzbeitrag Inproceedings | 2020 |