Conferences  >  Mathematics  >  Automated Theorem Proving

Hausdorff Research Institute for Mathematics (HIM)

The goal of this program is to bring together experts of Formal Mathematics, exploit their interactions, foster future collaborations, and interface them better with the mathematical mainstream. At the same time the goal is to provide a platform for junior researchers to enter Formal Mathematics. A central, unifying theme is to break down adoption barriers of formal methods in Mathematics.

Courses and Events for Math Students and Early Career Researchers,    Mathematical Logic and Foundations

The Conference on Theoretical and Computational Algebra 2024 will be held at the University of Aveiro, in Aveiro, Portugal, from Sunday 30, June, to Friday 5, July 2024.

(Sunday 30 June is the arrival day, with only a welcome session and check-in to the venue late in the day; talks will be from Monday 1 to Thursday 4, July; departure day is Friday 5 July.)

Celebrating the Contributions of John Meakin

We are delighted to announce that the upcoming 2024 Conference on Theoretical and Computational Algebra will feature a special tribute to John Meakin. His exceptional research career and indelible mark on algebra are underscored by his thoughtful care for students and kindness.

Please come to Aveiro for a joyful gathering of distinguished scientists and friends.

Hausdorff Research Institute for Mathematics (HIM)

This workshop focusses on the man / machine interaction in Formal Mathematics. Presently, most formal proofs are practically unreadable by average mathematicians, as they appear like specialized computer code. Can this be improved by making proof languages "readable", or by automatic translation from formalizations into a natural language-like format?

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Proof theory is the study of formal proofs as mathematical objects in their own right. The subject has enjoyed continued attention among computer scientists in particular due to its significance for formalization, metalogic, and automation. In recent decades there has been a surge of interest on the representations of formal proofs themselves. The outcomes of these investigations have been remarkable, in particular extending the scope of structural proof theory to novel and richer settings. The point of this Dagstuhl Seminar is twofold. First and foremost, we want to bring together theorists and practitioners exploiting proof representations to identify new directions of application and, simultaneously, distill new theoretical directions from problems “in the wild”. At the same time, this seminar will expose the interface between the proof-normalization and proof-search traditions by probing proof representations from both directions.

Term rewriting is a powerful model of computation that underlies much of declarative programming and which is heavily used in symbolic computation in mathematics, theorem proving, and protocol verification. The 14th International School on Rewriting takes place at the University Center Obergurgl, Austria. The school is aimed at master and PhD students, researchers and practitioners interested in the study of rewriting concepts and their applications.

Information Theory, Foundations of Computer Science,    Software Engineering

ICMS - International Centre for Mathematical Sciences

This workshop will unite zero-knowledge researchers in the UK and Europe and facilitate community building, especially among PhD students and early career researchers. The content that is presented will be published online as a lasting resource. The ultimate objective of the workshop is to have a significant long-term effect on research in zero-knowledge proofs and privacy-enhancing techniques by encouraging connections and creating resources for researchers.

The workshop will cover several topics within this field, including classical results, interactive oracle proofs, proof from symmetric primitives, group and pairing-based proof systems such as ZK-SNARKs, lattice-based proof systems, and real-world applications.

Predicative Foundations, Constructive Mathematics and Type Theory, Computation in Higher Types, Extraction of Programs from Proofs

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

The problem of deciding whether a propositional formula is satisfiable (SAT) is one of the most fundamental problems in computer science, both theoretically and practically. Due to its practical implications, intensive research has been performed on how to solve SAT problems in an automated fashion, and SAT solving is now a ubiquitous tool to solve many hard problems, both from industry and mathematics. SAT is also increasingly being applied in logics that are not decidable, particularly in the context of first-order theorem proving. Here, fast SAT solvers are used for reasoning sub-tasks and for guiding the theorem provers. The main aim of this Dagstuhl Seminar is to bring together researchers from different areas of activity on SAT and researchers that work in the field of first-order theorem proving so that they can communicate state-of-the-art advances and embark on a systematic interaction that will enhance the synergy between the different areas.

Joint Research Center for Advanced and Fundamental Mathematics for Industry

Isaac Newton Institute for Mathematical Sciences

The 2025 Big Proof workshop is a follow-up to the successful 2017 Big Proof programme at the INI and the 2019 follow-up workshop at ICMS. Since these workshops, there has been an explosion of work in the large-scale formalization of mathematics with spinoff activity targeting mathematical models in other fields. The 2025 Workshop is an opportunity to exchange experiences and ideas and craft a forward-looking research roadmap. The workshop will focus on pragmatic foundations, scalable proof automation, tradeoffs between expressiveness and automation, interchange formats, indexable digital libraries, the role of machine learning in proof, social aspects of digital mathematics, and broader applications of proof technology. We hope to build on the enthusiastic response to prior Big Proof events to plan and launch major initiatives around the large-scale formalization of mathematical knowledge.