1 citations · 3 across the 7 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.LO2026
Completeness of Synthesis under Realizability Assumptions using Superposition
Márton Hajdu, Petra Hozzová, Laura Kovács +1
Program synthesis is the task of automatically deriving a program that has been specified by a user in advance. Combining automated theorem proving with program synthesis enables t…
cs.LO2026
Lean on Vampire Proofs (Short Paper)
Jonas Bodingbauer, Márton Hajdu, Laura Kovács +2
Vampire proves theorems completely automatically in first- and higher-order logic extended with theories. Proof checking is increasingly demanded to consolidate user trust in Vampi…