Franz Xaver Reichl

Address:
Franz Xaver Reichl
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Room: HA0406
Phone: +43(1)58801–192135
Email: freichl@ac.tuwien.ac.at
Web: http://www.ac.tuwien.ac.at/people/freichl/

Software

  • Pedant: A certifying DQBF solver (GitHub).
  • eSLIM: A tool for improving the size of Boolean circuits (GitHub).

Publications

6 results
2024
[6]eSLIM: Circuit Minimization with SAT Based Local Improvement
, ,
27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) (Supratik Chakraborty, Jie-Hong Roland Jiang, eds.), volume 305 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1–23:14, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
2023
[5]Circuit Minimization with QBF-Based Exact Synthesis
, ,
Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 (Brian Williams, Yiling Chen, Jennifer Neville, eds.), pages 4087–4094, 2023, AAAI Press.
[bibtex] [pdf] [doi]
[4]Circuit Minimization with Exact Synthesis: From QBF Back to SAT
, ,
Proceedings of the 32nd International Workshop on Logic & Synthesis (IWLS), 2023.
[bibtex]
2022
[3]Pedant: A Certifying DQBF Solver
,
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 20:1–20:10, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
2021
[2]Certified DQBF Solving by Definition Extraction
, ,
Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 499–517, 2021, Springer Verlag.
[bibtex] [pdf] [doi]
[1]First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving
,
Proceedings of the 9th International Symposium on Symbolic Computation in Software Science, SCSS 2021, Hagenberg, Austria, September 8-10, 2021 (Temur Kutsia, ed.), volume 342 of EPTCS, pages 99–113, 2021.
[bibtex] [pdf] [doi]

Competitions

  • 1st Place with Friedrich Slivovsky at the DQBF track of the QBF Evaluation 2022
  • 1st Place with Friedrich Slivovsky at the DQBF track of the QBF Gallery 2023
  • 3rd Place with Friedrich Slivovsky and Stefan Szeider at the IWLS Programming Contest 2022
  • 2nd Place with Friedrich Slivovsky and Stefan Szeider at the IWLS Programming Contest 2023