TU Wien Informatics

20 Years

Role

2023W

2024S

 

  • Saturating Sorting without Sorts / Georgiou, P., Hajdu, M., & Kovacs, L. (2024). Saturating Sorting without Sorts. arXiv. https://doi.org/10.34726/5861
    Download: Preprint (322 KB)
    Projects: ARTIST (2021–2026) / SFB SPyCoDe (2023–2026)
  • Getting Saturated with Induction / Hajdu, M., Hozzová, P., Kovács, L., Reger, G., & Voronkov, A. (2022). Getting Saturated with Induction. In J.-F. Raskin, K. Chatterjee, L. Doyen, & R. Majumdar (Eds.), Principles of Systems Design (Vol. 13660, pp. 306–322). Springer Cham. https://doi.org/10.1007/978-3-031-22337-2_15
    Download: PDF (446 KB)
    Projects: ARTIST (2021–2026) / DK - Logic (2014–2023)
  • The Vampire Approach to Induction (short paper) / Hajdu, M., Kovacs, L., Rawson, M., & Voronkov, A. (2022). The Vampire Approach to Induction (short paper). In B. Konev, C. Schon, & A. Steen (Eds.), PAAR 2022. Practical Aspects of Automated Reasoning 2022.  Proceedings of the Workshop on Practical Aspects of Automated Reasoning. https://doi.org/10.34726/4103
    Download: PDF (836 KB)
  • Induction with Recursive Definitions in Superposition / Hajdu, M., Hozzova, P., Kovacs, L., & Voronkov, A. (2021). Induction with Recursive Definitions in Superposition. In Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design – FMCAD 2021 (Vol. 2, pp. 246–255). TU Wien Academic Press. https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_34
    Download: PDF (350 KB)
  • Inductive Benchmarks for Automated Reasoning / Hajdu, M., Hozzova, P., Kovacs, L., Schoisswohl, J., & Voronkov, A. (2021). Inductive Benchmarks for Automated Reasoning. In Intelligent Computer Mathematics. 14th International Conference, CICM 2021, Timisoara, Romania, July 26–31, 2021. Proceedings (pp. 124–129). Springer. https://doi.org/10.34726/1563
    Download: PDF (216 KB)
    Projects: ARTIST (2021–2026) / Symcar (2016–2021)
  • Automating inductive reasoning with recursive functions / Hajdu, M. (2020). Automating inductive reasoning with recursive functions [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.84140
    Download: PDF (961 KB)