Friedrich Slivovsky

According to our database, Friedrich Slivovsky authored at least 39 papers between 2012 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Fine-Grained Complexity Analysis of Dependency Quantified Boolean Formulas.

Che Cheng, Long-Hin Fung, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan

Proceedings of the 28th International Conference on Theory and Applications of Satisfiability Testing, 2025

2024

eSLIM.

Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider

Dataset, November, 2024

Strategy Extraction by Interpolation.

Friedrich Slivovsky

Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing, 2024

eSLIM: Circuit Minimization with SAT Based Local Improvement.

Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing, 2024

Hardness of Random Reordered Encodings of Parity for Resolution and CDCL.

Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Dataset of Random Reordered Encodings of Parity Problems.

Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider

Dataset, December, 2023

Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF.

Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Circuit Minimization with QBF-Based Exact Synthesis.

Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Towards Uniform Certification in QBF.

Leroy Chew, Friedrich Slivovsky

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Quantified CDCL with Universal Resolution.

Friedrich Slivovsky

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

Pedant: A Certifying DQBF Solver.

Franz-Xaver Reichl, Friedrich Slivovsky

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

2021

Certified DQBF Solving by Definition Extraction.

Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Proof Complexity of Symbolic QBF Reasoning.

Stefan Mengel, Friedrich Slivovsky

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Davis and Putnam Meet Henkin: Solving DQBF with Resolution.

Joshua Blinkhorn, Tomás Peitl, Friedrich Slivovsky

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Engineering an Efficient Boolean Functional Synthesis Engine.

Priyanka Golia, Friedrich Slivovsky, Subhajit Roy, Kuldeep S. Meel

Proceedings of the IEEE/ACM International Conference On Computer Aided Design, 2021

2020

A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth.

Friedrich Slivovsky, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Short Q-Resolution Proofs with Homomorphisms.

Ankit Shukla, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness.

Matthias Schlaipfer, Friedrich Slivovsky, Georg Weissenbacher, Florian Zuleger

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Fixed-Parameter Tractability of Dependency QBF with Structural Parameters.

Robert Ganian, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing.

Friedrich Slivovsky

Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

2019

Qute in the QBF Evaluation 2018.

Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

J. Satisf. Boolean Model. Comput., 2019

Proof Complexity of Fragments of Long-Distance Q-Resolution.

Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Combining Resolution-Path Dependencies with Dependency Learning.

Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

2018

Polynomial-Time Validation of QCDCL Certificates.

Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Sum-of-Products with Default Values: Algorithms and Complexity Results.

Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider

Proceedings of the IEEE 30th International Conference on Tools with Artificial Intelligence, 2018

Portfolio-Based Algorithm Selection for Circuit QBFs.

Holger H. Hoos, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Principles and Practice of Constraint Programming, 2018

2017

Dependency Learning for QBF.

Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

2016

Soundness of Q-resolution with dependency schemes.

Friedrich Slivovsky, Stefan Szeider

Theor. Comput. Sci., 2016

Quantifier Reordering for QBF.

Friedrich Slivovsky, Stefan Szeider

J. Autom. Reason., 2016

Long Distance Q-Resolution with Dependency Schemes.

Tomás Peitl, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Knowledge Compilation Meets Communication Complexity.

Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015

On Compiling CNFs into Structured Deterministic DNNFs.

Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

On Compiling Structured CNFs to OBDDs.

Simone Bova, Friedrich Slivovsky

Proceedings of the Computer Science - Theory and Applications, 2015

2014

Expander CNFs have Exponential DNNF Size.

Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky

CoRR, 2014

Variable Dependencies and Q-Resolution.

Friedrich Slivovsky, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2013

Model Counting for CNF Formulas of Bounded Modular Treewidth.

Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Meta-kernelization with Structural Parameters.

Robert Ganian, Friedrich Slivovsky, Stefan Szeider

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Model Counting for Formulas of Bounded Clique-Width.

Friedrich Slivovsky, Stefan Szeider

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Computing Resolution-Path Dependencies in Linear Time , .

Friedrich Slivovsky, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012