Programme
Venue and Registration
- Venue: The workshop takes place in the Red Room in building B at the Czech Institute of Informatics, Robotics, and Cybernetics (CIIRC), Czech Technical University in Prague (CTU), Czech Republic. (Use entrance B from the street Jugoslávských partyzánů and then follow the signs; the registration desk will be open Monday from 8:45 a.m.)
- Registration: See the TABLEAUX website for more information about the venue and information on how to register for TABLEAUX and the AReCCa workshop.
Schedule
Monday, 18 September 2023
| 09:15-09:20 | Opening of the AReCCa Workshop Jens Otten and Wolfgang Bibel |
|
| 09:20-10:40 | Session 1 (Session Chair: Michael Rawson) | |
| 09:20-10:00 | 20 Years of leanCoP - An Overview
Jens Otten |
|
| 10:00-10:40 | A Curiously Effective Backtracking Strategy
for Connection Tableaux
Michael Färber |
|
| 10:40-11:10 | Coffee Break | |
| 11:10-12:30 | Session 2 (Session Chair: Jens Otten) | |
| 11:10-11:50 | nanoCoP-Omega: A Non-Clausal Connection
Prover with Arithmetic
Leo Repp and Mario Frank |
|
| 11:50-12:30 | Embedding the Connection Calculus in
Satisfiability Modulo Theories
Clemens Eisenhofer, Laura Kovacs and Michael Rawson |
|
| 12:30-14:00 | Lunch Break | |
| 14:00-15:20 | Session 3 (Session Chair: Jens Otten) | |
| 14:00-14:40 | Comparison of Proof Methods
Wolfgang Bibel |
|
| 14:40-15:20 | Structure-Generating First-Order Theorem
Proving
Christoph Wernhard |
|
| 15:20-15:50 | Coffee Break | |
| 15:50-17:50 | Session 4 (Session Chair: Josef Urban) | |
| 15:50-16:30 | Connections: Markov Decision Processes for
Classical, Intuitionistic and Modal Connection Calculi
Fredrik Rømming, Jens Otten and Sean B. Holden |
|
| 16:30-17:10 | Connect++: A fast, flexible and modifiable
connection prover to support machine learning
Sean Holden |
|
| 17:10-17:50 | A Standardized Syntax for Connection Proofs
Jens Otten and Sean Holden |
|