PROGRAM
Days: Monday, July 28th Tuesday, July 29th Wednesday, July 30th Thursday, July 31st Friday, August 1st Saturday, August 2nd
Monday, July 28th
View this program: with abstractssession overviewtalk overview
08:45-09:00 Session 2: Welcome
- Opening of the Conference by the Chairs
- Official Greeting by the President of DHBW Stuttgart, Prof. Dr. Beate Sieger-Hanus
Chairs:
Location: A0.06
09:00-10:00 Session 3: CADE Invited Talk
Chair:
Location: A0.06
09:00 | Choose Your Proofs: Commutativity and Symmetry for Smarter Reasoning |
10:00-10:30 Session 4: SMT I
Chair:
Location: A0.06
10:00 | Being polite is not enough (and other limits of theory combination) (abstract) |
10:30-11:00Coffee Break
11:00-12:30 Session 5: SMT II
Chair:
Location: A0.06
11:00 | On Symbol Elimination and Uniform Interpolation in Theory Extensions (abstract) |
11:30 | What's Decidable About Arrays With Sums? (abstract) |
12:00 | Cazamariposas: Automated Instability Debugging in SMT-based Program Verification (abstract) |
12:30-14:00Lunch Break
14:00-15:30 Session 6: SMT III
Chair:
Location: A0.06
14:00 | Boosting MCSat Modulo Nonlinear Integer Arithmetic via Local Search. (abstract) |
14:30 | More is Less: Adding Polynomials for Faster Explanations in NLSAT (abstract) |
15:00 | Ground Truth: Checking Vampire Proofs via Satisfiability Modulo Theories (abstract) |
15:15 | SMT and Functional Equation Solving over the Reals: Challenges from the IMO (abstract) |
15:30-16:00Coffee Break
16:00-18:00 Session 7: Rewriting
Chair:
Location: A0.06
16:00 | Lexicographic Combination of Reduction Pairs (abstract) |
16:30 | Confluence of Almost Parallel-Closed Generalized Term Rewriting Systems (abstract) |
17:00 | The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting (abstract) PRESENTER: Johannes Niederhauser |
17:30 | Sort-Based Confluence Criteria for Non-Left-Linear Higher-Order Rewriting (abstract) |
Tuesday, July 29th
View this program: with abstractssession overviewtalk overview
09:00-10:00 Session 8: CADE Invited Talk
Chair:
Location: A0.06
09:00 | Taming Infinity for Verification in First-Order Logic |
10:00-10:30 Session 9: Short Talks
Chair:
Location: A0.06
10:00 | Interoperability of Proof systems with SC-TPTP (System Description) (abstract) |
10:15 | Verified Path Indexing (abstract) |
10:30-11:00Coffee Break
11:00-12:30 Session 10: Formalizations in Isabelle/HOL
Chair:
Location: A0.06
11:00 | Simplified and Verified: A Second Look at a Proof-Producing Union-Find Algorithm (abstract) |
11:30 | Faithful Logic Embeddings in HOL – Deep and Shallow (abstract) |
12:00 | A Stepwise Refinement Proof that SCL(FOL) Simulates Ground Ordered Resolution (abstract) |
12:30-14:00Lunch Break
14:00-15:30 Session 11: Calculi
Location: A0.06
14:00 | Cut Elimination for Negative Free Logics with Definite Descriptions (abstract) |
14:30 | From Modal Sequent Calculi to Modal Resolution (abstract) |
15:00 | A Fresh Inductive Approach to Useful Call-by-Value (abstract) |
15:30-16:00Coffee Break
16:00-17:00 Session 12: Machine Learning for Automated Deduction
Chair:
Location: A0.06
16:00 | Efficient Neural Clause-Selection Reinforcement (abstract) |
16:30 | Learning Conjecturing from Scratch (abstract) |
Wednesday, July 30th
View this program: with abstractssession overviewtalk overview
09:00-10:30 Session 14A: Model Checking and Quantifier Elimination
Chair:
Location: A0.06
09:00 | A Theorem Prover Based Approach for SAT-Based Model Checking Certification (abstract) |
09:30 | Infinite State Model Checking by Learning Transitive Relations (abstract) |
10:00 | Relatively Complete and Efficient Partial Quantifier Elimination (abstract) PRESENTER: Estifanos Getachew |
09:00-16:00 Session 14B: CASC
Location: A0.07
10:30-11:00Coffee Break
11:00-12:30 Session 15: Saturation
Chair:
Location: A0.06
11:00 | Computing Witnesses Using the SCAN Algorithm (abstract) |
11:30 | Partial Redundancy in Saturation (abstract) |
12:00 | Term Ordering Diagrams (abstract) |
12:30-13:30Lunch Break
Thursday, July 31st
View this program: with abstractssession overviewtalk overview
09:00-10:00 Session 16: CADE Invited Talk
Chair:
Location: A0.06
09:00 | A Decade of Lean: Advancing Proof Automation for Mathematics and Software Verification |
10:00-10:30 Session 17: Paramodulation
Location: A0.06
10:00 | Exploiting Instantiations from Paramodulation Proofs in Isabelle/HOL (abstract) |
10:30-11:00Coffee Break
11:00-12:30 Session 18: Equational Reasoning
Chair:
Location: A0.06
11:00 | Computing Ground Congruence Classes (abstract) |
11:30 | Anti-pattern templates (abstract) |
12:00 | Equational Reasoning Modulo Commutativity in Languages with Binders (abstract) |
12:30-14:00Lunch Break
14:00-15:30 Session 19: Non-Classical Logics
Chair:
Location: A0.06
14:00 | Uniform Interpolation and Forgetting for Large-Scale Ontologies with Application to Semantic Difference in SNOMED CT (abstract) |
14:30 | Concrete Domains Meet Expressive Cardinality Restrictions in Description Logics (abstract) PRESENTER: Filippo De Bortoli |
15:00 | A Real-Analytic Approach to Differential-Algebraic Dynamic Logic (abstract) |
15:30-16:00Coffee Break
16:00-17:00 Session 20: SAT
Chair:
Location: A0.06
16:00 | Entailment vs. Verification for Partial-assignment Satisfiability and Enumeration (abstract) |
16:30 | Unfolding Boxes with Local Constraints (abstract) |
Friday, August 1st
View this program: with abstractssession overviewtalk overview
09:00-10:30 Session 22A: Deduktionstreffen (1)
Chair:
09:00 | TBA |
10:00 | Premise Selection with the Alternating-Path-Method (abstract) |
09:00-10:30 Session 22B: Weidenbach60 (1)
Location: A0.07
09:00 | TBA |
10:00 | Conflict-based Literal Model Generation (abstract) |
09:30-10:30 Session 23: Automated Deduction in Geometry (1st session)
Chair:
09:30 | Towards automatic detection of geometric difficulty of geometry problems (abstract) |
10:00 | Manifold-based Proving Methods in Projective Geometry (abstract) |
10:30-11:00Coffee Break
11:00-12:00 Session 24A: Automated Deduction in Geometry (2)
Chair:
11:00 | Geometry Machine Revisited (abstract) |
11:30 | Is a regular polygon determined by its diagonals? (abstract) |
11:00-12:30 Session 24B: Deduktionstreffen (2)
Chair:
11:00 | TBA |
12:00 | Mathematical Knowledge Bases as Grammar-Compressed Proof Terms: Exploring Metamath Proof Structures (abstract) |
11:00-12:30 Session 24C: Weidenbach60 (2)
Location: A0.07
11:00 | Invariant Synthesis: Decidable Fragments to the Rescue (abstract) |
11:30 | Applying SCAN to Basic Path Logic and the Ordered Fragment (Extended Abstract) (abstract) |
12:00 | Planning with Equality (abstract) |
12:30-14:00Noon Break
14:00-15:30 Session 25A: Automated Deduction in Geometry (3)
Chair:
14:00 | Computing loci with GeoGebra Discovery: some issues and suggestions (abstract) |
14:30 | Inference Maximizing Point Configurations for Parsimonious Algorithms (abstract) |
14:00-15:30 Session 25B: Deduktionstreffen (3)
Chair:
14:00 | TBA |
15:00 | Towards the Verification of Higher-Order Logic Automated Reasoning (abstract) |
14:00-15:30 Session 25C: Weidenbach60 (3)
Location: A0.07
14:00 | Solving Non-Linear Optimization with the Cylindrical Algebraic Covering Method (abstract) |
14:30 | Polite theory combination, an overview (abstract) |
15:00 | From Building Blocks to Real SAT Solvers (abstract) |
15:30-16:00Coffee Break
16:00-17:30 Session 26A: Automated Deduction in Geometry (4)
Chair:
16:00 | Different Types of Locus Dependencies in Solving Geometry Construction Problems (abstract) |
16:30 | Towards a Structural Analysis of Interesting Geometric Theorems: Analysis of a Survey (abstract) |
17:00 | Singular points of plane curves obtained from geometric constructions: automated methods in man-and-machine collaboration (abstract) |
16:00-18:00 Session 26B: Deduktionstreffen (4)
Chair:
16:00 | Analyzing Weighted Abstract Reduction Systems via Semirings (abstract) |
16:30 | Proving Call-by-value Termination of Constrained Higher-order Rewriting by Dependency Pairs (abstract) PRESENTER: Carsten Fuhs |
16:00-18:00 Session 26C: Weidenbach60 (4)
Location: A0.07
16:00 | The TPTP Format for Tableaux Proofs (abstract) |
16:30 | A Lambda-Superposition Tactic for Isabelle/HOL (abstract) |
17:00 | Formalizing Axiomatics for First-Order Logic (abstract) |
Saturday, August 2nd
View this program: with abstractssession overviewtalk overview
09:00-10:30 Session 27A: Automated Deduction in Geometry (5)
Chair:
09:00 | Automating Geometry Construction Problems |
10:00 | First-Order Simplification of GeoCoq using Dedukti (abstract) PRESENTER: Pierre Boutry |
09:00-10:00 Session 27C: Theorem Proving Components for Educational Software (joint session with ADG)
Invited Talk by Vesna Marinkovic
Chair:
09:00-10:30 Session 27D: TPTPTP (1)
Chair:
09:00 | Welcome |
09:10 | Review of the TPTP format for derivations |
09:30 | Proof Verification with GDV and GDV-LP |
10:00 | Leo-III and LambdaPi |
10:30-11:00Coffee Break
11:00-12:00 Session 28A: Automated Deduction in Geometry (6)
Chair:
11:00 | An Automated Approach towards Constructivizing the GeoCoq Library (abstract) PRESENTER: Alexandre Jean |
11:30 | On the Coq/Rocq Mechanization of Beeson's "On the Notion of Equal Figures in Euclid" (abstract) |
11:00-12:00 Session 28C: Theorem Proving Components for Educational Software (2)
Chair:
11:00 | Reinforcing students’ proof structure with Waterproof: an analysis (abstract) |
11:30 | Evaluating LLMs on Formal Models Coursework (abstract) |
11:00-12:30 Session 28D: TPTPTP (2)
Chair:
11:00 | Vampire and Dedukti |
11:30 | Higher-order Verification of Skolemization Steps |
12:00 | Equisatisfiable Inferences |
12:30-14:00Noon Break
14:00-15:30 Session 29A: Automated Deduction in Geometry (7)
Chair:
14:00 | ADG-Lib Initiative (abstract) |
14:30 | A Generator of Geometry Deductive Database Method Provers (abstract) |
14:00-15:00 Session 29C: Theorem Proving Components for Educational Software (3)
14:00 | Teaching Automated Deduction: an Implementation-BasedApproach with Maude (abstract) |
14:30 | Teaching Axiomatic Systems and Metatheory in Isabelle (abstract) |
14:00-15:30 Session 29D: TPTPTP (3)
Chair:
14:00 | The TPTP Format for Clausal Connection Tableau Proofs |
14:30 | The TPTP Format for Interpretations |
15:00 | The ProoVer Competition at IJCAR 2026 |
15:00-15:30 Session 30: Theorem Proving Components for Educational Software - Business Meeting
Chair:
15:30-16:00Coffee Break
16:00-17:00 Session 31A: Automated Deduction in Geometry (8)
Chair:
16:00 | IsaGeoCoq, a port of GeoCoq with Isabelle/HOL (abstract) |
16:30 | Proving theorems on regular polygons by elimination --- the elementary way (abstract) |