Program for Tuesday, July 29th: Talk View

PROGRAM FOR TUESDAY, JULY 29TH: TALK VIEW

Days:

previous day

next day

all days

View: with abstracts session overview

9:00

9:30

10:00

10:30

11:00

11:30

12:00

12:30

13:00

13:30

14:00

14:30

15:00

15:30

16:00

16:30

17:00

17:30

18:00

18:30

09:00-10:00

Taming Infinity for Verification in First-Order Logic

Sharon Shoham

10:00-10:15

Interoperability of Proof systems with SC-TPTP (System Description)

Guilloud, Gambhir, Poiroux, Herklotz, Bourgeat, Kuncak, Cailler

10:15-10:30

Verified Path Indexing

Mohamed Chaabani, Simon Robillard

11:00-11:30

Simplified and Verified: A Second Look at a Proof-Producing Union-Find Algorithm

Lukas Stevens, Rebecca Ghidini

11:30-12:00

Faithful Logic Embeddings in HOL – Deep and Shallow

Christoph Benzmüller

12:00-12:30

A Stepwise Refinement Proof that SCL(FOL) Simulates Ground Ordered Resolution

Martin Bromberger, Martin Desharnais, Christoph Weidenbach

14:00-14:30

Cut Elimination for Negative Free Logics with Definite Descriptions

Andrzej Indrzejczak

14:30-15:00

From Modal Sequent Calculi to Modal Resolution

Dirk Pattinson, Cláudia Nalon, Sourabh Peruri

15:00-15:30

A Fresh Inductive Approach to Useful Call-by-Value

Pablo Barenbaum, Delia Kesner, Mariana Milicich

16:00-16:30

Efficient Neural Clause-Selection Reinforcement

Martin Suda

16:30-17:00

Learning Conjecturing from Scratch

Thibault Gauthier, Josef Urban

17:00-18:30 Awards

10:30-11:00 Coffee Break

12:30-14:00 Lunch Break

15:30-16:00 Coffee Break