TU Wien Informatics

20 Years
Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

Jakob Rath

Projektass. Dipl.-Ing. / BSc

Role

Contact

  • High-yield liquid phase exfoliation of graphene utilizing low boiling co-solvent solutions and ammonia / Nastran, M., Peschek, P., Walendzik, I., Rath, J., Fickl, B., Schubert, J. S., Szabo, G., Wilhelm, R. A., Schmidt, J., Eder, D., & Bayer-Skoff, B. (2024, June 24). High-yield liquid phase exfoliation of graphene utilizing low boiling co-solvent solutions and ammonia [Poster Presentation]. NT24, Cambridge, Boston, United States of America (the).
  • SAT-Based Subsumption Resolution / Coutelier, R., Kovács, L., Rawson, M., & Rath, J. (2023). SAT-Based Subsumption Resolution. In B. Pientka & C. Tinelli (Eds.), Automated Deduction – CADE 29  29th International Conference on Automated Deduction, Rome, Italy, July 1–4, 2023, Proceedings (pp. 190–206). Springer. https://doi.org/10.1007/978-3-031-38499-8_11
  • The Emergence of 2D Building Units in Metal‐Organic Frameworks for Photocatalytic Hydrogen Evolution: A Case Study with COK‐47 / Ayala, P., Naghdi, S., Nandan, S. P., Myakala, S. N., Rath, J., Saito, H., Guggenberger, P., Lakhanlal, L., Kleitz, F., Toroker, M. C., Cherevan, A., & Eder, D. (2023). The Emergence of 2D Building Units in Metal‐Organic Frameworks for Photocatalytic Hydrogen Evolution: A Case Study with COK‐47. Advanced Energy Materials, 13(31), Article 2300961. https://doi.org/10.1002/aenm.202300961
  • First-Order Subsumption via SAT Solving / Rath, J., Biere, A., & Kovács, L. (2022). First-Order Subsumption via SAT Solving. In A. Griggio & N. Rungta (Eds.), Proceedings of the 22nd Conference on Formal Methods in Computer-Aided Design – FMCAD 2022 (pp. 160–169). TU Wien Academic Press. https://doi.org/10.34727/2022/isbn.978-3-85448-053-2_22
    Download: PDF (551 KB)
  • PolySAT - a word-level solver for large bitvectors / Rath, J., Bjørner, N., Kovacs, L., Nutz, A., & Sagiv, M. (2022, September 1). PolySAT - a word-level solver for large bitvectors [Presentation]. Formal Reasoning about Financial Systems, Stanford, United States of America (the). http://hdl.handle.net/20.500.12708/154065
  • Automated Generation of Exam Sheets for Automated Deduction / Hozzová, P., Kovács, L., & Rath, J. (2021). Automated Generation of Exam Sheets for Automated Deduction. In Intelligent Computer Mathematics. 14th International Conference, CICM 2021, Timisoara, Romania, July 26–31, 2021. Proceedings (pp. 185–196). Springer. https://doi.org/10.34726/1562
    Download: PDF (458 KB)
    Projects: ARTIST (2021–2026) / Symcar (2016–2021)
  • Subsumption Demodulation in First-Order Theorem Proving / Gleiss, B., Kovacs, L., & Rath, J. (2020). Subsumption Demodulation in First-Order Theorem Proving. In N. Peltier & V. Sofronie-Stokkermans (Eds.), Automated Reasoning (pp. 297–315). Lecture Notes in Computer Science, Springer. https://doi.org/10.1007/978-3-030-51074-9_17
  • Inconsistency Proofs for ASP: The ASP - DRUPE Format / ALVIANO, M., DODARO, C., FICHTE, J. K., HECHER, M., PHILIPP, T., & RATH, J. (2019). Inconsistency Proofs for ASP: The ASP - DRUPE Format. In Theory and Practice of Logic Programming (pp. 891–907). TPLP. https://doi.org/10.1017/s1471068419000255
    Project: START (2014–2022)
  • Forward Subsumption Demodulation - Fast Conditional Rewriting in Vampire / Gleiss, B., Kovacs, L., & Rath, J. (2019). Forward Subsumption Demodulation - Fast Conditional Rewriting in Vampire. Vampire 2019 - The Sixth Vampire Workshop, Lisbon, Portugal. http://hdl.handle.net/20.500.12708/86993
  • Subsumption Demodulation in First-Order Theorem Proving / Rath, J. (2019). Subsumption Demodulation in First-Order Theorem Proving. First International Workshop on Proof Theory for Automated Deduction, Automated Deduction for Proof Theory, Funchal, Portugal. http://hdl.handle.net/20.500.12708/86992
  • Subsumption demodulation in first-order theorem proving / Rath, J. (2019). Subsumption demodulation in first-order theorem proving [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.69280
    Download: PDF (4.58 MB)
  • Integrating Answer Set Programming with Procedural Languages / Rath, J., & Redl, C. (2017). Integrating Answer Set Programming with Procedural Languages. In Y. Lierler & W. Taha (Eds.), Practical Aspects of Declarative Languages (pp. 50–67). Springer. https://doi.org/10.1007/978-3-319-51676-9_4
    Project: IE of ASP (2015–2018)