Friedrich Slivovsky

60 papers A* 6A 24B 4Misc 1Journal 24Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Model Counting for Dependency Quantified Boolean Formulas. AAAI Long-Hin Fung, Che Cheng, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan
2026	B	`conf`	The Complexity of Games with Randomised Control. FoSSaCS Sarvin Bahmani, Rasmus Ibsen-Jensen, Soumyajit Paul, Sven Schewe, Friedrich Slivovsky, Qiyi Tang, Dominik Wojtczak, Shufang Zhu
2026	J	`jnl`	The Complexity of Games with Randomised Control. CoRR Sarvin Bahmani, Rasmus Ibsen-Jensen, Soumyajit Paul, Sven Schewe, Friedrich Slivovsky, Qiyi Tang, Dominik Wojtczak, Shufang Zhu
2025	A	`conf`	Fine-Grained Complexity Analysis of Dependency Quantified Boolean Formulas. SAT Che Cheng, Long-Hin Fung, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan
2025	J	`jnl`	Model Counting for Dependency Quantified Boolean Formulas. CoRR Long-Hin Fung, Che Cheng, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan
2024	A*	`conf`	Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. AAAI Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider
2024	J	`jnl`	Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. CoRR Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider
2024	A	`conf`	Strategy Extraction by Interpolation. SAT Friedrich Slivovsky
2024	J	`jnl`	Towards Uniform Certification in QBF. Log. Methods Comput. Sci. Leroy Chew, Friedrich Slivovsky
2024	A	`conf`	eSLIM: Circuit Minimization with SAT Based Local Improvement. SAT Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
2023	A	`ed.`	26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, Alghero, Italy, July 4-8, 2023 SAT Meena Mahajan, Friedrich Slivovsky
2023	A*	`conf`	Circuit Minimization with QBF-Based Exact Synthesis. AAAI Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
2023	A*	`conf`	Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. LICS Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
2023	J	`jnl`	Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. CoRR Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
2022	A	`conf`	Pedant: A Certifying DQBF Solver. SAT Franz-Xaver Reichl, Friedrich Slivovsky
2022	A	`conf`	Quantified CDCL with Universal Resolution. SAT Friedrich Slivovsky
2022	J	`jnl`	Sum-of-Products with Default Values: Algorithms and Complexity Results. J. Artif. Intell. Res. Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
2022	A	`conf`	Towards Uniform Certification in QBF. STACS Leroy Chew, Friedrich Slivovsky
2022	J	`jnl`	Towards Uniform Certification in QBF. CoRR Leroy Chew, Friedrich Slivovsky
2021	A	`conf`	Certified DQBF Solving by Definition Extraction. SAT Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
2021	J	`jnl`	Certified DQBF Solving by Definition Extraction. CoRR Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
2021	A	`conf`	Davis and Putnam Meet Henkin: Solving DQBF with Resolution. SAT Joshua Blinkhorn, Tomás Peitl, Friedrich Slivovsky
2021	A	`conf`	Engineering an Efficient Boolean Functional Synthesis Engine. ICCAD Priyanka Golia, Friedrich Slivovsky, Subhajit Roy, Kuldeep S. Meel
2021	J	`jnl`	Engineering an Efficient Boolean Functional Synthesis Engine. CoRR Priyanka Golia, Friedrich Slivovsky, Subhajit Roy, Kuldeep S. Meel
2021	A	`conf`	Proof Complexity of Symbolic QBF Reasoning. SAT Stefan Mengel, Friedrich Slivovsky
2021	J	`jnl`	Proof Complexity of Symbolic QBF Reasoning. CoRR Stefan Mengel, Friedrich Slivovsky
2021	J	`jnl`	Towards Uniform Certification in QBF. Electron. Colloquium Comput. Complex. Leroy Chew, Friedrich Slivovsky
2020	A	`conf`	A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. SAT Friedrich Slivovsky, Stefan Szeider
2020	A*	`conf`	Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. KR Robert Ganian, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2020	—	`conf`	Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing. CAV (1) Friedrich Slivovsky
2020	A	`conf`	Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness. SAT Matthias Schlaipfer, Friedrich Slivovsky, Georg Weissenbacher, Florian Zuleger
2020	A	`conf`	Short Q-Resolution Proofs with Homomorphisms. SAT Ankit Shukla, Friedrich Slivovsky, Stefan Szeider
2019	A	`conf`	Combining Resolution-Path Dependencies with Dependency Learning. SAT Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2019	J	`jnl`	Dependency Learning for QBF. J. Artif. Intell. Res. Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2019	J	`jnl`	Long-Distance Q-Resolution with Dependency Schemes. J. Autom. Reason. Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2019	A	`conf`	Proof Complexity of Fragments of Long-Distance Q-Resolution. SAT Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2019	J	`jnl`	Qute in the QBF Evaluation 2018. J. Satisf. Boolean Model. Comput. Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2018	A	`conf`	Polynomial-Time Validation of QCDCL Certificates. SAT Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2018	A	`conf`	Portfolio-Based Algorithm Selection for Circuit QBFs. CP Holger H. Hoos, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2018	B	`conf`	Sum-of-Products with Default Values: Algorithms and Complexity Results. ICTAI Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
2017	A	`conf`	Dependency Learning for QBF. SAT Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2017	J	`jnl`	On Compiling Structured CNFs to OBDDs. Theory Comput. Syst. Simone Bova, Friedrich Slivovsky
2016	A*	`conf`	Knowledge Compilation Meets Communication Complexity. IJCAI Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
2016	A	`conf`	Long Distance Q-Resolution with Dependency Schemes. SAT Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2016	J	`jnl`	Meta-kernelization with structural parameters. J. Comput. Syst. Sci. Robert Ganian, Friedrich Slivovsky, Stefan Szeider
2016	J	`jnl`	Model Counting for CNF Formulas of Bounded Modular Treewidth. Algorithmica Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider
2016	J	`jnl`	Quantifier Reordering for QBF. J. Autom. Reason. Friedrich Slivovsky, Stefan Szeider
2016	J	`jnl`	Soundness of Q-resolution with dependency schemes. Theor. Comput. Sci. Friedrich Slivovsky, Stefan Szeider
2015	A	`conf`	On Compiling CNFs into Structured Deterministic DNNFs. SAT Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
2015	Misc	`conf`	On Compiling Structured CNFs to OBDDs. CSR Simone Bova, Friedrich Slivovsky
2014	J	`jnl`	Expander CNFs have Exponential DNNF Size. CoRR Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
2014	J	`jnl`	Model Counting for Formulas of Bounded Clique-Width. CoRR Friedrich Slivovsky, Stefan Szeider
2014	J	`jnl`	On Compiling Structured CNFs to OBDDs. CoRR Simone Bova, Friedrich Slivovsky
2014	A	`conf`	Variable Dependencies and Q-Resolution. SAT Friedrich Slivovsky, Stefan Szeider
2013	J	`jnl`	Meta-Kernelization with Structural Parameters CoRR Robert Ganian, Friedrich Slivovsky, Stefan Szeider
2013	B	`conf`	Meta-kernelization with Structural Parameters. MFCS Robert Ganian, Friedrich Slivovsky, Stefan Szeider
2013	A	`conf`	Model Counting for CNF Formulas of Bounded Modular Treewidth. STACS Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider
2013	B	`conf`	Model Counting for Formulas of Bounded Clique-Width. ISAAC Friedrich Slivovsky, Stefan Szeider
2012	J	`jnl`	Computing Resolution-Path Dependencies in Linear Time CoRR Friedrich Slivovsky, Stefan Szeider
2012	A	`conf`	Computing Resolution-Path Dependencies in Linear Time , . SAT Friedrich Slivovsky, Stefan Szeider