Date: 11-13 May 2023
Venue: Liège, Belgium
Thursday 11 May: A4/R30 morning, A4/S100 afternoon
Friday 12 May: Salle MIPS, Institut Montefiore, Sart Tilman (outside Liège, take bus 48)
Saturday 13 May: A4/S100 (downtown)
This is the second EuroProofNet WG2 meeting, which will take the form of a hackathon, from Thursday May 11 morning to Saturday May 13 mid-afternoon.
Cost: Participants will have to pay for their travel, accommodation and meals. If you are reimbursed by EuroProofNet, note that the daily allowance has been fixed to 160 euros. See the reimbursement rules for more details.
Working alone or in small groups on the development of tools for automated theorem proving and proofs (in particular Dedukti proofs), taking advantage of the participation of experts on Dedukti, formula and proof exchange standards, and theorem provers and solvers, and to make progress on EuroProofNet objectives and deliverables. See previous meeting.
|Thursday 11 May
|Get together, planning work, scheduling work sessions
|TPTP and proofs
|Friday 12 May
|SMT and proofs
|Saturday 13 May
Bruno Andreotti, Frédéric Blanqui, Bernard Boigelot, Guillaume Burel, Roland Coghetto, Alessio Coltellacci, Robin Coutelier, Bruno Dutertre, Mathias Fleury, Pascal Fontaine, Chantal Keller, Anja Petković Komel, Lucas Michel, Tanja Schindler, Stephan Schulz, Hans-Jörg Schurr, Claude Stolze, Martin Suda, Alex Steen, Baptiste Vergain
On Thursday May 11 morning, Frédéric Blanqui and Guillaume Burel presented Dedukti. Frédéric’s slide set 1, Frédéric’s slide set 2, Frédéric’s slide set 3, Guillaume’s slides. Thursday morning has been dedicated to understanding Dedukti, discussing previous works on transforming proofs from automated theorem provers to Dedukti, and details about encoding particular proof steps inside Dedukti.
On Thursday May 11 afternoon, Geoff Sutcliffe presented TPTP, TSTP proofs, and tools to handle outputs from automated theorem provers supporting these languages. Geoff’s pages. Thursday afternoon has been dedicated to discussions on how to translate TSTP proofs into Dedukti, the difficulties associated to particular rules used for some solvers, and a road map for efficient and complete understanding of TSTP proofs has been discussed. The discussion will be continued notably at the WG2 meeting/TPTP tea party, in July.
On Friday May 12 morning, Hans-Jörg Schurr presented SMT and the Alethe proof format. Hans-Jörg’s material The discussion took the whole half day, and several points were discussed, notably planned evolution with SMT-LIB 3, aspects of Skolemization, difficulties in extending the format, and issues in proof checking.
Friday May 12 afternoon was dedicated to discussions and works in smaller groups (report below).
On Saturday May 13 morning, Bruno Andreotti presented the Carcara tool for handling SMT Alethe proofs. Bruno’s slides. The remaining of Saturday morning was dedicated to discussions on proof tools and proof elaboration, essentially around SMT.
Activities in small groups
Saturday May 13 afternoon was dedicated to discussions and works in smaller groups (report below).
Stephan Schulz improved the proof output for a pedagogical tool for propositional logic, and worked on debugging the interaction of higher-order logic and ite in E.
Alexander Steen, Martin Suda and Anja Petković Komel worked with Frederic Blanqui and Guillame Burel to better understand Dedukti and LambdaPi, and get up-to-date with previous attempts at formalizing ATP proofs in Dedukti. They started working on a concept for a tool that takes TPTP proofs from Vampire and Leo-III, and translates them into a lampdaPi verification file.
Bruno Andreotti, Frédéric Blanqui, Alessio Coltellacci, Pascal Fontaine, and Hans-Jörg Schurr discussed how to implement a translation of Alethe proofs to Dedukti. Bruno Andreotti did preliminary works on Carcara to support a possible proof translation module.
Pascal Fontaine and Alexander Steen worked on the inventory of provers, formats, and tools. Several people contributed to improve the wiki.
Claude Stolze worked on the implementation of integers and polynoms on integers in Dedukti.