CI-BD-SOQE continues a series of previous workshops on Craig interpolation (CI), Beth definability (BD), and second-order quantifier elimination (SOQE):
Broadly viewed, CI, BD, and SOQE concern the existence and computation of formulas that simultaneously satisfy semantic as well as certain syntactic constraints. Since such existence/computation questions arise in many different areas of computer science, CI, BD, and SOQE have been thoroughly investigated, which has led to a large number of results, from foundational issues to practical applications. Relevant fields include proof theory, model theory, proof complexity, automated reasoning, automata theory, knowledge representation, program verification and databases as well as philosophy and linguistics.
Topics of interest for the workshop include, but are not limited to:
The aim of the workshop is to bring together researchers from the many relevant fields to exchange experiences and findings about approaches, techniques, ongoing research and important open problems. We strongly believe that CI, BD, and SOQE – beyond sharing a similar historical background – offer a common basis for fruitful cross-disciplinary exchange.
TBA
TBA
| w/c 4 May 2026 | Workshop paper/extended abstract submission | |
| w/c 18 May 2026 | Reviews due | |
| w/c 25 May 2026 | Notification | |
| w/c 1 Jun 2026 | Early registration for FLoC 2026 | |
| w/c 8 Jun 2026 | Camera-ready version due | |
| 24–25 July 2026 | CI-BD-SOQE Workshop @ FLoC 2026 |
TBA
| Stefan Hetzl | TU Wien, Austria | |
| Jean Christoph Jung | TU Dortmund University, Germany | |
| Renate A. Schmidt | The University of Manchester, UK | |
| Christoph Wernhard | University of Potsdam, Germany |