First-Order Reasoning, Below and Beyond: Workshop in Honor of Christoph Weidenbach’s 60th Birthday
This workshop is organized to honor and celebrate the 60th birthday of Christoph Weidenbach, a well-known figure in the automated reasoning community.
The workshop will be part of CADE-30 in Stuttgart. It will be held on August 1st, 2025.
We currently plan post-proceedings with Springer to be published later.
Scope
Relevant topics include but are not limited to:
- First-order reasoning
- SAT solving
- SMT solving
- Rewriting
- CNF transformation
Call For Paper
Weidenbach’60: First-Order Reasoning, Below and Beyond: Workshop in Honor of Christoph Weidenbach’s 60th Birthday. August 1st, 2025, Stuttgart, Germany co-located with CADE-30
We invite you to contribute to Weidenbach’60, a workshop in celebration of Prof. Christoph Weidenbach’s 60th birthday.
Christoph is a well-known figure in the automated reasoning community, a leader of the Automation of Logic group at Max-Planck-Institut für Informatik, Saarbrucken, a former president of CADE Inc, and the main developer of the well-known automatic prover SPASS.
We invite contributions in areas close to Christoph’s research, including but not limited to first-order reasoning, decidable fragments, SAT and SMT solving, combination of theories, rewriting, and automated verification.
We solicit 1) extended abstracts of up to 4 pages (presentation only), and 2) full papers of up to 16 pages (excluding bibliography) both in the Springer Computer Science Proceedings style submitted via easychair.
Full papers will be published in a Festschrift, LNCS series of Springer, after the event. The authors of long papers are expected to take part in and help with the reviewing process.
Important dates
- Extended Abstract:
May 28th, 2025, extended to June 5th, 2025 (AoE) - Notification: July 2nd, 2025
- Workshop: August 1, 2025
Program
Preliminary program:
Friday, August 1st | |
---|---|
09:00-10:30 | Invited talk by Christoph Weidenbach |
Sophie Tourret, Conflict-based Literal Model Generation | |
10:30-11:00 | Coffee Break |
11:00-12:30 | Stephan Merz, Invariant Synthesis: Decidable Fragments to the Rescue |
Renate A. Schmidt and Hongkai Yin, Applying SCAN to Basic Path Logic and the Ordered Fragment (Extended Abstract) | |
David Plaisted and Stephan Schulz, Planning with Equality | |
12:30-14:00 | Pause |
14:00-15:30 | Valentin Promies and Erika Abraham, Solving Non-Linear Optimization with the Cylindrical Algebraic Covering Method |
Guilherme Toledo, Benjamin Przybocki, and Yoni Zohar, Polite theory combination, an overview | |
Yasmine Briefs and Mathias Fleury, From Building Blocks to Real SAT Solvers | |
15:30-16:00 | Coffee Break |
16:00-17:30 | Geoff Sutcliffe, Sean Holden, and Mantas Baksys, The TPTP Format for Tableaux Proofs |
Massin Guerdi, A Lambda-Superposition Tactic for Isabelle/HOL | |
Jørgen Villadsen, Simon Tobias Lund, and Anders Schlichtkrull, Formalizing Axiomatics for First-Order Logic | |
19:00- | Dinner at Roberts (https://roberts-stuttgart.de/) |