BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Peiran Wu (KU Leuven)
DTSTART:20261117T140000Z
DTEND:20261117T150000Z
DTSTAMP:20261117T012206Z
UID:UEAPS/85
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/UEAPS/85/">C
 ertified grounding with CertiFOX</a>\nby Peiran Wu (KU Leuven) as part of 
 ANTLR seminar\n\n\nAbstract\nThe ground-and-solve strategy\, where high-le
 vel theories are first translated into equivalent or equisatisfiable quant
 ifier-free formulas\, is an important method in declarative problem solvin
 g. While proof formats like DRAT and VeriPB exist for certifying results o
 f SAT and pseudo-Boolean solvers\, a trust gap remains for the grounding s
 tep of the strategy. Without certificates for grounding\, one cannot be su
 re that the ground formulas produced by the grounder and passed to the sol
 ver – let alone the solutions – actually correspond to the original pr
 oblem specification.\n\n\n\nIn this talk\, I will present CertiFOX\, a nov
 el certifying grounding framework for first-order logic model expansion (F
 OX) over finite domains. Central to the framework is a proof system we are
  developing for grounding derivations. Our tool suite includes GroundFOX\,
  a proof-logging grounder\, and CheckFOX\, a proof-log checker. Also in ac
 tive development is LeanFOX\, a formally verified checker implemented inde
 pendently in Lean. LeanFOX provides stronger guarantees for the soundness 
 of the proof system and the correctness of verified proof logs. I will dem
 onstrate how the grounder and checkers work and share some discoveries we 
 made while implementing LeanFOX.\n
LOCATION:https://researchseminars.org/talk/UEAPS/85/
END:VEVENT
END:VCALENDAR
