default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFriedrich Slivovsky
Person information
- affiliation: University of Liverpool, UK
- affiliation (former): TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Leroy Chew, Friedrich Slivovsky:
Towards Uniform Certification in QBF. Log. Methods Comput. Sci. 20(1) (2024)- [c32]Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider
:
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. AAAI 2024: 7978-7986 - [c31]Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider:
eSLIM: Circuit Minimization with SAT Based Local Improvement. SAT 2024: 23:1-23:14 - [c30]Friedrich Slivovsky:
Strategy Extraction by Interpolation. SAT 2024: 28:1-28:20 - [i12]Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider:
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. CoRR abs/2402.00542 (2024) - 2023
- [c29]Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider:
Circuit Minimization with QBF-Based Exact Synthesis. AAAI 2023: 4087-4094 - [c28]Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak:
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. LICS 2023: 1-14 - [e1]Meena Mahajan, Friedrich Slivovsky:
26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy. LIPIcs 271, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-286-0 [contents] - [d1]Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider:
Dataset of Random Reordered Encodings of Parity Problems. Zenodo, 2023
- [i11]Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak:
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. CoRR abs/2304.13896 (2023) - 2022
- [j9]Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider:
Sum-of-Products with Default Values: Algorithms and Complexity Results. J. Artif. Intell. Res. 73: 535-552 (2022) - [c27]Franz-Xaver Reichl, Friedrich Slivovsky:
Pedant: A Certifying DQBF Solver. SAT 2022: 20:1-20:10 - [c26]Friedrich Slivovsky:
Quantified CDCL with Universal Resolution. SAT 2022: 24:1-24:16 - [c25]Leroy Chew, Friedrich Slivovsky:
Towards Uniform Certification in QBF. STACS 2022: 22:1-22:23 - [i10]Leroy Chew, Friedrich Slivovsky:
Towards Uniform Certification in QBF. CoRR abs/2210.07085 (2022) - 2021
- [c24]Priyanka Golia, Friedrich Slivovsky, Subhajit Roy, Kuldeep S. Meel:
Engineering an Efficient Boolean Functional Synthesis Engine. ICCAD 2021: 1-9 - [c23]Joshua Blinkhorn, Tomás Peitl, Friedrich Slivovsky:
Davis and Putnam Meet Henkin: Solving DQBF with Resolution. SAT 2021: 30-46 - [c22]Stefan Mengel, Friedrich Slivovsky:
Proof Complexity of Symbolic QBF Reasoning. SAT 2021: 399-416 - [c21]Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider:
Certified DQBF Solving by Definition Extraction. SAT 2021: 499-517 - [i9]Stefan Mengel, Friedrich Slivovsky:
Proof Complexity of Symbolic QBF Reasoning. CoRR abs/2104.02563 (2021) - [i8]Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider:
Certified DQBF Solving by Definition Extraction. CoRR abs/2106.02550 (2021) - [i7]Priyanka Golia, Friedrich Slivovsky, Subhajit Roy, Kuldeep S. Meel:
Engineering an Efficient Boolean Functional Synthesis Engine. CoRR abs/2108.05717 (2021) - [i6]Leroy Chew, Friedrich Slivovsky:
Towards Uniform Certification in QBF. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c20]Friedrich Slivovsky:
Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing. CAV (1) 2020: 508-528 - [c19]Robert Ganian, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. KR 2020: 392-402 - [c18]Friedrich Slivovsky, Stefan Szeider:
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. SAT 2020: 267-276 - [c17]Ankit Shukla, Friedrich Slivovsky, Stefan Szeider:
Short Q-Resolution Proofs with Homomorphisms. SAT 2020: 412-428 - [c16]Matthias Schlaipfer, Friedrich Slivovsky, Georg Weissenbacher, Florian Zuleger:
Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness. SAT 2020: 429-446
2010 – 2019
- 2019
- [j8]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Dependency Learning for QBF. J. Artif. Intell. Res. 65: 180-208 (2019) - [j7]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Long-Distance Q-Resolution with Dependency Schemes. J. Autom. Reason. 63(1): 127-155 (2019) - [j6]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Qute in the QBF Evaluation 2018. J. Satisf. Boolean Model. Comput. 11(1): 261-272 (2019) - [c15]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Combining Resolution-Path Dependencies with Dependency Learning. SAT 2019: 306-318 - [c14]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Proof Complexity of Fragments of Long-Distance Q-Resolution. SAT 2019: 319-335 - 2018
- [c13]Holger H. Hoos, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Portfolio-Based Algorithm Selection for Circuit QBFs. CP 2018: 195-209 - [c12]Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider:
Sum-of-Products with Default Values: Algorithms and Complexity Results. ICTAI 2018: 733-737 - [c11]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Polynomial-Time Validation of QCDCL Certificates. SAT 2018: 253-269 - 2017
- [j5]Simone Bova, Friedrich Slivovsky:
On Compiling Structured CNFs to OBDDs. Theory Comput. Syst. 61(2): 637-655 (2017) - [c10]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Dependency Learning for QBF. SAT 2017: 298-313 - 2016
- [j4]Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider:
Model Counting for CNF Formulas of Bounded Modular Treewidth. Algorithmica 76(1): 168-194 (2016) - [j3]Friedrich Slivovsky, Stefan Szeider:
Quantifier Reordering for QBF. J. Autom. Reason. 56(4): 459-477 (2016) - [j2]Robert Ganian, Friedrich Slivovsky, Stefan Szeider:
Meta-kernelization with structural parameters. J. Comput. Syst. Sci. 82(2): 333-346 (2016) - [j1]Friedrich Slivovsky, Stefan Szeider:
Soundness of Q-resolution with dependency schemes. Theor. Comput. Sci. 612: 83-101 (2016) - [c9]Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky:
Knowledge Compilation Meets Communication Complexity. IJCAI 2016: 1008-1014 - [c8]Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Long Distance Q-Resolution with Dependency Schemes. SAT 2016: 500-518 - 2015
- [c7]Simone Bova, Friedrich Slivovsky:
On Compiling Structured CNFs to OBDDs. CSR 2015: 80-93 - [c6]Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky:
On Compiling CNFs into Structured Deterministic DNNFs. SAT 2015: 199-214 - 2014
- [c5]Friedrich Slivovsky, Stefan Szeider:
Variable Dependencies and Q-Resolution. SAT 2014: 269-284 - [i5]Friedrich Slivovsky, Stefan Szeider:
Model Counting for Formulas of Bounded Clique-Width. CoRR abs/1409.8464 (2014) - [i4]Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky:
Expander CNFs have Exponential DNNF Size. CoRR abs/1411.1995 (2014) - [i3]Simone Bova, Friedrich Slivovsky:
On Compiling Structured CNFs to OBDDs. CoRR abs/1411.5494 (2014) - 2013
- [c4]Friedrich Slivovsky, Stefan Szeider:
Model Counting for Formulas of Bounded Clique-Width. ISAAC 2013: 677-687 - [c3]Robert Ganian, Friedrich Slivovsky, Stefan Szeider:
Meta-kernelization with Structural Parameters. MFCS 2013: 457-468 - [c2]Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider:
Model Counting for CNF Formulas of Bounded Modular Treewidth. STACS 2013: 55-66 - [i2]Robert Ganian, Friedrich Slivovsky, Stefan Szeider:
Meta-Kernelization with Structural Parameters. CoRR abs/1303.1786 (2013) - 2012
- [c1]Friedrich Slivovsky, Stefan Szeider:
Computing Resolution-Path Dependencies in Linear Time , . SAT 2012: 58-71 - [i1]Friedrich Slivovsky, Stefan Szeider:
Computing Resolution-Path Dependencies in Linear Time. CoRR abs/1202.3097 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
