SAT Live! (original) (raw)

In 2024 the SAT Association established the Fahiem Bacchus PhD Award in Satisfiability. The award distinguishes one outstanding PhD thesis from the past year in the field of Satisfiability, broadly construed. The award is named after Fahiem Bacchus who made significant contributions to the theory and practice of SAT as well as to the SAT community and the SAT Association. Deadline extended to June 10, 2025.

The 2nd International Workshop on Highlights in Organizing and Optimizing Proof-logging Systems (WHOOPS '25) will be held on September 13-14, 2025, at Institut Pascal in Orsay on the outskirts of Paris in coordination with the EuroProofNet Workshop on Automated Reasoning and Proof Logging, which is in turn part of the Final EuroProofNet Symposium.

List of workshops associated with the SAT 2025 conference. The workshops will be held on the 10th and 11th of August in Glasgow, before the conference.

Invitation to submit papers to the SMT workshops to be held together with the 2025 SAT conference.

The 10th SC-Square Workshop is a satellite event of CADE, held at the Duale Hochschule Baden-Württemberg (DHBW) Stuttgart, Baden-Württemberg Cooperative State University Stuttgart, Fakultät Technik in Stuttgart, Germany, from July 28 to 31, 2025. Submission deadline extended.

PoS 2025 will be co-located with the 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025) and the 31st International Conference on Principles and Practice of Constraint Programming (CP 2025).

The 6th International Workshop on Counting, Sampling, and Synthesis (MCW 2025) will be held in Glasgow, UK, featuring talks on all aspects of model counting, sampling, and automated synthesis.

A new edition of the International Summer School on Satisfiability, Satisfiability Modulo Theories, and Automated Reasoning will take place on August 6–8, 2025 at University of St Andrews, Scotland

The 2nd Workshop on Composite AI (CompAI-25), co-located with IJCAI 2025 Montreal, Canada, August 16–22, 2025 is waiting for your contributions by May 9

Four AI TT-Professorships at JKU Linz

Invitation to submit papers to the SMT workshops to be held together with the 2025 SAT conference.

The Vienna Center for Logic and Algorithms of TU Wien calls for the nomination of authors of outstanding theses and scientific works in the field of Logic and Computer Science, in the two categories outstanding master thesis and outstanding undergraduate thesis awards. The degree must have been awarded between January 1st, 2024 and December 31st, 2024 (inclusive).

The 10th SC-Square Workshop is a satellite event of CADE, held at the Duale Hochschule Baden-Württemberg (DHBW) Stuttgart, Baden-Württemberg Cooperative State University Stuttgart, Fakultät Technik in Stuttgart, Germany, from July 28 to 31, 2025.

Invitation to submit proposals for workshops to be held at the 2025 SAT conference.

SAT'25 will take place August 10-15 in Glasgow, Scotland. Submissions (long papers, short papers, tool papers) are expected by March 27th AoE (abstracts due March 20th AoE).

Two fully-funded PhD positions at KU Leuven. Join the proof logging revolution and make combinatorial optimizers deliver 100% correctness guarantees.

The Department of Computer Science at Lund University invites applications for a PhD position in theoretical computer science and/or combinatorial optimization.

ERC-Funded PostDoc position available at KU Leuven. Join the proof logging revolution and make combinatorial optimizers deliver 100% correctness guarantees.

The young investigator group on Scalable Automated Reasoning at the Department of Informatics at the Karlsruhe Institute of Technology (KIT, in Germany) is looking for a research assistant (a.k.a. doctoral researcher, PhD student), beginning as soon as possible.

The Department of Computer Science at the University of Copenhagen (DIKU) invites applications from professors at all levels within all areas of computer science to join our department! Needless to say, the Algorithms and Complexity Section would particularly welcome strong applicants in algorithms, complexity theory, and automated reasoning to strengthen and expand our world-leading research environment.