TU Wien Informatics

20 Years

Role

  • Circuit Minimization with Exact Synthesis: From QBF Back to SAT / Reichl, F. X., Slivovsky, F., & Szeider, S. (2023). Circuit Minimization with Exact Synthesis: From QBF Back to SAT. In IWLS 2023: 32nd International Workshop on Logic & Synthesis (pp. 98–105).
  • Circuit Minimization with QBF-Based Exact Synthesis / Reichl, F.-X., Slivovsky, F., & Szeider, S. (2023). Circuit Minimization with QBF-Based Exact Synthesis. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (pp. 4087–4094). AAAI Press. https://doi.org/10.1609/aaai.v37i4.25524
    Download: PDF (154 KB)
  • Pedant: A Certifying DQBF Solver / Reichl, F. X., & Slivovsky, F. (2022). Pedant: A Certifying DQBF Solver. In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) (pp. 1–10). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAT.2022.20
    Download: PDF (569 KB)
  • First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving / Schreiner, W., & Reichl, F.-X. (2021). First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving. In Electronic Proceedings in Theoretical Computer Science (pp. 99–113). https://doi.org/10.4204/eptcs.342.9
  • Certified DQBF Solving by Definition Extraction / Reichl, F.-X., Slivovsky, F., & Szeider, S. (2021). Certified DQBF Solving by Definition Extraction. In Theory and Applications of Satisfiability Testing – SAT 2021 (pp. 499–517). LNCS / Springer. https://doi.org/10.1007/978-3-030-80223-3_34