Lydia G. Kondylidou

“Reasoning about Reasoning”

prof_pic.jpg

Room L 103,

Oettingenstr. 67

80538 Munich, Germany

Hi! I’m Lydia Kondylidou, a postdoctoral researcher in the Department of Theoretical Computer Science and Theorem Proving at LMU Munich. I completed my PhD at LMU Munich in November 2026 (magna cum laude), under the supervision of Prof. Jasmin Blanchette, with the thesis Finding, Simplifying and Presenting Proofs Automatically.

My research is in automated reasoning and automated theorem proving, including extending SMT solvers with native higher-order reasoning, minimizing first-order proofs, and translating machine-generated proofs into readable ones. I also work on program verification with Boole, the intermediate verification language of the CSLib initiative, in collaboration with Clark Barrett’s group at Stanford University.

news

Nov 02, 2026 Defended my PhD thesis Finding, Simplifying and Presenting Proofs Automatically at LMU Munich, magna cum laude (1.13)
Oct 25, 2026 Local Arrangements Chair, LPAR-26, Spetses, Greece
Mar 26, 2026 Subreviewer, IJCAR 2026
Jun 15, 2025 Subreviewer, IJCAR 2024
Jun 15, 2025 Subreviewer, OOPSLA 25

talks

latest publications

  1. Readable Proofs for the Horn Fragment
    Lydia Kondylidou, Jasmin Blanchette, Nicholas Smallbone, and 1 more author
    2027
    Submitted
  2. Tao’s Equational Proof Challenge Accepted
    Lydia Kondylidou, Jasmin Blanchette, and Marijn J.H. Heule
    In IJCAR, 2026
  3. Enumerating Choice Terms in Model-Based Quantifier Instantiation
    Lydia Kondylidou, Andrew Reynolds, Jasmin Blanchette, and 1 more author
    In TACAS, 2026
  4. Augmenting Model-Based Instantiation with Fast Enumeration
    Lydia Kondylidou, Andrew Reynolds, and Jasmin Blanchette
    In TACAS, 2025