TU Wien Informatics

Role

2020W

 

2019

  • An Introduction to Knowledge Compilation / F. Slivovsky / Talk: Kocoon Workshop, Arras, Frankreich (invited); 2019-12-16 - 2019-12-19
  • Dependency Learning for QBF / T. Peitl, F. Slivovsky, S. Szeider / Journal of Artificial Intelligence Research, 65 (2019), 65; 181 - 208
  • Proof Complexity of Fragments of Long-Distance Q-Resolution / T. Peitl, F. Slivovsky, S. Szeider / Talk: Theory and Application of Satisfiability Testing -- SAT, Lissabon; 2019-07-07 - 2019-07-12; in: "Theory and Applications of Satisfiability Testing - SAT 2019", Lecture Notes in Computer Science, 11628 (2019), ISBN: 978-3-030-24257-2; 319 - 335
  • Combining Resolution-Path Dependencies with Dependency Learning / T. Peitl, F. Slivovsky, S. Szeider / Talk: Int. Conference on Theory and Applications of Satisfiability Testing, Lissabon; 2019-07-07 - 2019-07-12; in: "Theory and Applications of Satisfiability Testing - SAT 2019", LNCS, 11628 (2019), ISBN: 978-3-030-24257-2; 306 - 318

2018

2017

  • On Compiling Structured CNFs to OBDDs / S. Bova, F. Slivovsky / Theory of Computing Systems, 61 (2017), 637 - 655
  • Dependency Learning for QBF / T. Peitl, F. Slivovsky, S. Szeider / in: "Theory and Applications of Satisfiability Testing - SAT 2017", © Springer International Publishing AG 2017, 2017, ISBN: 978-3-319-66263-3, 198 - 313

2016

2015

  • Dependency Schemes for Quantified Boolean Formulas / F. Slivovsky / Talk: International Workshop on Quantified Boolean Formulas, Austin, Texas (invited); 2015-09-23
  • Model Counting for CNF Formulas of Bounded Modular Treewidth / D. Paulusma, F. Slivovsky, S. Szeider / Algorithmica, First online: 17 July 2015 (2015), 1 - 27
  • Quantifier Reordering for QBF / F. Slivovsky, S. Szeider / Journal of Automated Reasoning, Volume 55 (2015), 1 - 19
  • Structure in #SAT and QBF / PhD Thesis by F. Slivovsky / Supervisor, Reviewer: S. Szeider, H. Chen; Institut für Computergraphik und Algorithmen, 2015; oral examination: 2015-05-05
  • On Compiling CNFs into Structured Deterministic DNNFs / S. Bova, F. Capelli, S. Mengel, F. Slivovsky / Talk: International Conference on the Theory and Applications of Satisfiability Testing, Austin, Texas; 2015-09-24 - 2015-09-27; in: "Proceedings of the 18th International Conference on Theory and Applications of Satisfiability Testing", LNCS, 9340 (2015), ISBN: 978-3-319-24317-7; 199 - 214
  • On Compiling Structured CNFs to OBDDs / S. Bova, F. Slivovsky / Talk: International Computer Science Symposium in Russia (CSR), Listvyanka, Russia; 2015-07-13 - 2015-07-17; in: "Proceedings of the 10th International Computer Science Symposium", LNCS, Volume 9139 2015 (2015), ISBN: 978-3-319-20296-9; 80 - 94

2014

  • Dependency Schemes and Q-resolution / F. Slivovsky, St. Szeider / Talk: International Conference on Theory and Applications of Satisfiability Testing (SAT), Vienna, Austria; 2014-07-14 - 2014-07-17; in: "SAT 2014", LNCS / Springer, 8561 (2014), ISBN: 978-3-319-09283-6; 269 - 284

2013

  • Variable Dependencies and Q-Resolution / F. Slivovsky, St. Szeider / Talk: International Workshop on Quantified Boolean Formulas, Helsinki, Finland; 2013-06-09; in: "International Workshop on Quantified Boolean Formulas 2013 Informal Workshop Report", F. Lonsing, M. Seidl (ed.); (2013), 22 - 29
  • Model Counting for Formulas of Bounded Clique-Width / F. Slivovsky, St. Szeider / Talk: International Symposium on Algorithms and Computation (ISAAC), Hong Kong; 2013-12-16 - 2013-12-18; in: "Algorithms and Computation: 24th International Symposium, ISAAC 2013", L. Cai, S. Cheng, T. Lam (ed.); Springer / LNCS, 8283 (2013), ISBN: 978-3-642-45029-7; 677 - 687
  • Model Counting for CNF Formulas of Bounded Modular Treewidth / D. Paulusma, F. Slivovsky, St. Szeider / Talk: Symposium on Theoretical Aspects of Computer Science (STACS), Kiel, Germany; 2013-02-27 - 2013-03-02; in: "30th Symposium on Theoretical Aspects of Computer Science (STACS´13)", N. Portier, T. Wilke (ed.); Dagstuhl Publishing, 20 (2013), ISBN: 978-3-939897-50-7; 55 - 66
  • Meta-kernelization with Structural Parameters / R. Ganian, F. Slivovsky, St. Szeider / Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS), Klosterneuburg, Austria; 2013-08-26 - 2013-08-30; in: "The 38th International Symposium on Mathematical Foundations of Computer Science, Proceedings", K. Chatterjee, J. Sgall (ed.); Springer / LNCS, 8087 (2013), ISBN: 978-3-642-40312-5; 457 - 468

2012

  • Computing Resolution-Path Dependencies in Linear Time / F. Slivovsky, St. Szeider / Talk: International Conference on Theory and Applications of Satisfiability Testing (SAT), Trento, Italy; 2012-06-17 - 2012-06-20; in: "Proceedings of the Fifteen International Conference on Theory and Applications of Satisfiability Testing (SAT 2012)", A. Cimatti, R. Sebastiani (ed.); LNCS / Springer, 7317 (2012), ISBN: 978-3-642-31611-1; 58 - 71

2010