Name Card

Full name Familienname, Vorname
Slivovsky, Friedrich
 
Main Affiliation Organisations­zuordnung
 

Own Publications Eigene Publikationen

Results 1-20 of 39 (Search time: 0.002 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Fichte, Johannes K. ; Ganian, Robert ; Hecher, Markus ; Slivovsky, Friedrich ; Ordyniak, Sebastian Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBFInproceedings Konferenzbeitrag 2023
2Reichl-2023-Circuit Minimization with QBF-Based Exact Synthesis-vor.pdf.jpgReichl, Franz-Xaver ; Slivovsky, Friedrich ; Szeider, Stefan Circuit Minimization with QBF-Based Exact SynthesisInproceedings Konferenzbeitrag 2023
3Reichl, Franz Xaver ; Slivovsky, Friedrich ; Szeider, Stefan Circuit Minimization with Exact Synthesis: From QBF Back to SATInproceedings Konferenzbeitrag 2023
4Slivovsky-2022-Quantified CDCL with Universal Resolution-vor.pdf.jpgSlivovsky, Friedrich Quantified CDCL with Universal ResolutionInproceedings Konferenzbeitrag 28-Jul-2022
5Reichl-2022-Pedant A Certifying DQBF Solver-vor.pdf.jpgReichl, Franz Xaver ; Slivovsky, Friedrich Pedant: A Certifying DQBF SolverInproceedings Konferenzbeitrag 28-Jul-2022
6Chew-2022-Towards Uniform Certification in QBF-vor.pdf.jpgChew, Leroy ; Slivovsky, Friedrich Towards Uniform Certification in QBFInproceedings Konferenzbeitrag 9-Mar-2022
7Ganian-2022-Journal of Artificial Intelligence Research-vor.pdf.jpgGanian, Robert ; Kim, Eun Jung ; Slivovsky, Friedrich ; Szeider, Stefan Sum-of-Products with Default Values: Algorithms and Complexity ResultsArticle Artikel 10-Feb-2022
8Slivovsky, Friedrich QBF Solvers and their Proof ComplexityPresentation Vortrag2022
9Blinkhorn, Joshua ; Peitl, Tomáš ; Slivovsky, Friedrich Davis and Putnam Meet Henkin: Solving DQBF with ResolutionKonferenzbeitrag Inproceedings 2021
10Mengel, Stefan ; Slivovsky, Friedrich Proof Complexity of Symbolic QBF ReasoningKonferenzbeitrag Inproceedings 2021
11Reichl, Franz-Xaver ; Slivovsky, Friedrich ; Szeider, Stefan Certified DQBF Solving by Definition ExtractionKonferenzbeitrag Inproceedings 2021
12Slivovsky, Friedrich ; Szeider, Stefan A Faster Algorithm for Propositional Model Counting Parameterized by Incidence TreewidthKonferenzbeitrag Inproceedings 2020
13Schlaipfer, Matthias ; Slivovsky, Friedrich ; Weissenbacher, Georg ; Zuleger, Florian Multi-linear Strategy Extraction for QBF Expansion Proofs via Local SoundnessKonferenzbeitrag Inproceedings 2020
14Slivovsky, Friedrich Interpolation-Based Semantic Gate Extraction and Its Applications to QBF PreprocessingKonferenzbeitrag Inproceedings 2020
15Shukla, Ankit ; Slivovsky, Friedrich ; Szeider, Stefan Short Q-Resolution Proofs with HomomorphismsKonferenzbeitrag Inproceedings 2020
16Ganian, Robert ; Peitl, Tomáš ; Slivovsky, Friedrich ; Szeider, Stefan Fixed-Parameter Tractability of Dependency QBF with Structural ParametersKonferenzbeitrag Inproceedings 2020
17Peitl, Tomas ; Slivovsky, Friedrich ; Szeider, Stefan Proof Complexity of Fragments of Long-Distance Q-ResolutionKonferenzbeitrag Inproceedings 2019
18Peitl, Tomas ; Slivovsky, Friedrich ; Szeider, Stefan Combining Resolution-Path Dependencies with Dependency LearningKonferenzbeitrag Inproceedings 2019
19Slivovsky, Friedrich An Introduction to Knowledge CompilationPräsentation Presentation2019
20Peitl, Tomáš ; Slivovsky, Friedrich ; Szeider, Stefan Dependency Learning for QBFArtikel Article 2019

Contributing Publications Mitbeteiligte Publikationen

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

PreviewAuthor(s)TitleTypeIssue Date
1De Colnet-2023-Separating Incremental and Non-Incremental Bottom-Up Compi...-vor.pdf.jpgDe Colnet, Alexis Separating Incremental and Non-Incremental Bottom-Up CompilationInproceedings Konferenzbeitrag 9-Aug-2023
2Fazekas-2023-IPASIR-UP User Propagators for CDCL-vor.pdf.jpgFazekas, Katalin ; Niemetz, Aina ; Preiner, Mathias ; Kirchweger, Markus ; Szeider, Stefan ; Biere, Armin IPASIR-UP: User Propagators for CDCLInproceedings Konferenzbeitrag 9-Aug-2023
3Breitenbrunner Manuel - 2023 - Certifying Unsatisfiability in an Expansion-Based...pdf.jpgBreitenbrunner, Manuel Certifying unsatisfiability in an expansion-based DQBF solverThesis Hochschulschrift 2023
4Rebola Pardo, Adrian Even Shorter Proofs Without New VariablesInproceedings Konferenzbeitrag 2023