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
 

Publications Publikationen

Results 1-4 of 4 (Search time: 0.001 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Slivovsky, Friedrich ; Szeider, Stefan A Faster Algorithm for Propositional Model Counting Parameterized by Incidence TreewidthKonferenzbeitrag Inproceedings 2020
2Schlaipfer, Matthias ; Slivovsky, Friedrich ; Weissenbacher, Georg ; Zuleger, Florian Multi-linear Strategy Extraction for QBF Expansion Proofs via Local SoundnessKonferenzbeitrag Inproceedings 2020
3Shukla, Ankit ; Slivovsky, Friedrich ; Szeider, Stefan Short Q-Resolution Proofs with HomomorphismsKonferenzbeitrag Inproceedings 2020
4Hecher, Markus ; Thier, Patrick ; Woltran, Stefan Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database TechnologyKonferenzbeitrag Inproceedings 2020