2024W

• Formal Methods in Computer Science / 185.A93 / UE

2025S

• Logic and Reasoning in Computer Science / 192.033 / VU

• SAT solving for variants of first-order subsumption / Coutelier, R., Rath, J., Rawson, M., Biere, A., & Kovacs, L. (2024). SAT solving for variants of first-order subsumption. Formal Methods in System Design. https://doi.org/10.1007/s10703-024-00454-1
  Download: SAT solving for variants of first-order subsumption (3.26 MB)
  Projects: DK - Logic (2014–2023) / ForSmart (2023–2027) / SFB SPyCoDe (2023–2026)
• 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