SAT Live!

Junior Professorship (W1, Tenure Track Full Professor W3) in Computational Logic

Thu, 11 Jun 2026 00:00:00 +0200

Junior Professorship (W1, Tenure Track Full Professor W3) in Computational Logic Ulm University, Germany Deadline: 30 June 2026 Reference number: 26078 Applications must be submitted via the online portal: https://stellenangebote.uni-ulm.de/jobposting/d4ccc62561a75b7b762e73e20c2575b2c08c36455

Ulm University, Germany, invites applications for a Junior Professorship (W1) in Computational Logic with Tenure Track to W3 to be filled as soon as possible.

Profile:

We are seeking an exceptional candidate with an international track record in the field of computational logic to strengthen the area of theoretical computer science at Ulm University with respect to research and teaching. We expect a track record in acquiring competitive third-party funding. The successful candidate will propose a research program that strengthens and complements the research expertise in the institute, the faculty and the university as a whole. We expect research expertise in all of the following research topics:

Distributed SAT-solving
Parallel SAT-solving
SAT solving on GPU-clusters
Application of SAT-solving for hybrid AI architectures

The university provides an ideal setting for the assistant professor, with numerous opportunities for interdisciplinary collaboration and exchange, e.g., the research training center KEMAI „Knowledge Infusion and Extraction for Explainable Medical AI“. Additionally, the Science City of Ulm and the Transfer Center for Digitization, Analytics & Data Science offer further connections and partnerships with local companies.

We are looking for an individual with a passion for teaching to strengthen our teaching portfolio for our computer science B.Sc. and M.Sc. programs. Basic-level instruction is offered in German while advanced courses may be taught in English. We expect strong teaching skills, documented, for example, by excellent teaching evaluations or continued educational training. Active participation in the faculty’s self-administration is expected.

If the evaluation is positive, appointment to a tenured W3 professorship will be offered. Requirements for a later transition to a W3 professorship are defined in the “Satzung der Universität Ulm zur Qualitätssicherung bei der Berufung und Evaluierung von Tenure-Track-Professoren und Tenure-Track-Professorinnen vom 21.11.2018” (Statutes of Ulm University regarding quality assurance during the appointment and evaluation of tenure track professors of 21 November 2018) and the subject-specific prerequisites for this professorship.

In addition to the general legal requirements, the employment requirements include completed university studies as well as teaching aptitute and special aptitude for academic work, which is usually demonstrated by the outstanding quality of a doctorate (§ 51 Abs. 2 LHG).

Seize the opportunity and join us in shaping the future of the University!

For further information, please contact: Prof. Dr. Matthias Tichy, matthias.tichy@uni-ulm.de

Postdoc positions in DQBF solving

Sun, 07 Jun 2026 00:00:00 +0200

I’m looking for a talented PostDoc to join the DQBF project: https://github.com/Sat-DQBF. The candidate will work on the development of DQBF solvers.

The last few decades have seen tremendous progress in the development of SAT solvers. However, it has also become clear that they are approaching their limits and are unable to scale to problems that are ill-suited to SAT-based encodings. DQBF (Dependency Quantified Boolean Formulas) is a generalization of the standard QBF that allows them to succinctly encode many hard problems arising in hardware verification, circuit designs and software synthesis.

The main goal of this project is to build a DQBF solver that scales well in applications. The project involves collaborators such as Friedrich Slivovsky (University of Liverpool) and Jie-Hong Roland Jiang (National Taiwan University).

The position is fully funded by UKRI EPSRC for the duration of 3 years. The ideal starting date is as soon as possible, but it is negotiable.

If you are interested or have any question, please contact me at tonytan@liverpool.ac.uk or Friedrich Slivovsky at F.Slivovsky@liverpool.ac.uk. We will be happy to answers any question.

Tony Tan
University of Liverpool 

3-4 year PhD position in Trento

Sat, 06 Jun 2026 00:00:00 +0200

This is a call for expressions of interest for a fully-funded 3-4 year PHD position at the IECS PhD School at DISI, University of Trento, Italy in Automated Reasoning, under the guidance of Prof. Roberto Sebastiani, on the topic:

"Knowledge Compilation Modulo Theories and Applications"

Potentially interested candidates should URGENTLY contact prof. Sebastiani by sending an email to roberto.sebastiani@unitn.it, with header: ‘PhD on Knowledge Compilation Modulo Theories’, with possibly a CV in attachment.

If the candidate profile is of potential interest, then an online meeting will be soon arranged.

PhD position on SAT-based machine learning at the University of Helsinki + ELLIS Institute Finland

Fri, 05 Jun 2026 00:00:00 +0200

One 4-year PhD position to work on logical reasoning and symbolic machine learning at the University of Helsinki + ELLIS Institute Finland.

The focus is on using SAT/ASP/SMT/MaxSAT methods for program synthesis / inductive logic programming.

More details here and here.

If interested, please email Andrew Cropper for more information at andrew.cropper@helsinki.fi.

Call for Participation: QBFGallery 2026

Fri, 24 Apr 2026 00:00:00 +0200

========================= CALL FOR CONTRIBUTIONS =======================

We warmly encourage developers of QBF solvers to submit their work, even at early stages of development, as long as it fulfills some very simple requirements. We also welcome the submission of QBF formulas to be used for the evaluation. Researchers thinking about using QBF-based techniques in their area (e.g., formal verification, planning, knowledge representation & reasoning) are invited to contribute to the evaluation by submitting QBF instances of their research problems (see the requirements for instances). The results of the evaluation will be a good indicator of the current feasibility of QBF-based approaches and a stimulus for people working on QBF solvers to further enhance their tools.

Important Dates

2026-05-17: Submission of benchmarks 2026-05-17: Submission of solvers 2026-05-20: Feedback on solver submissions May, June 2026: evaluation runs 2026-07-19: presentation of results at the QBF 2026 Workshop

Organization

Cynthia Peyrer, Johannes Kepler University Linz
Luca Pulina, University of Sassari
Martina Seidl, Johannes Kepler University Linz

Second Call for Papers: 2nd Workshop on Machine Learning for Solvers and Provers (at FLoC 2026)

Fri, 24 Apr 2026 00:00:00 +0200

===========================================

The 2nd Workshop on Machine Learning for Solvers and Provers (ML4SP)

    July 18, 2026, Lisbon, Portugal

===========================================

Workshop page: https://ml4sp.github.io/

We warmly invite you to submit your work to the 2nd Workshop on Machine Learning for Solvers and Provers (ML4SP), organised as part of the 2026 Federated Logic Conference (FLoC 2026) at Lisbon, Portugal. The workshop will run during the first block of the conference, on July 18, 2026.

Topics

Machine learning (ML) has had a substantial impact on SAT/SMT and CP solvers, as well as automated theorem provers. Recent advances have demonstrated the power of ML to inform solver heuristics, guide proof search, and optimize algorithm portfolios. Despite growing interest in this direction, work on ML for solvers and provers is often scattered across multiple research communities – SAT, SMT, CP, theorem proving, formal methods, and machine learning – with few opportunities for focused interaction.

The ML4SP workshop aims to bring together researchers and practitioners working at the intersection of machine learning and formal reasoning systems. It provides a forum for the presentation of recent work, the exchange of ideas, and the fostering of collaboration between these communities.

Topics of interest include, but are not limited to, ML-driven approaches for:

Heuristics (branching, restarts, …) in CP, SAT, SMT, and MIP solvers
Tactic selection and proof guidance in automated and interactive theorem provers
Algorithm selection, parameter tuning and algorithm configuration, and portfolio solvers
End-to-end learning for solvers and provers
Benchmark generation and instance hardness prediction
Applications of ML-enhanced reasoning in verification, synthesis, planning, and related areas
Leveraging large language models (LLMs) for solver heuristics and proof guidance

Submission

We welcome submissions describing previously published work, ongoing research, and position papers and early-stage ideas intended to stimulate discussion.

Submission should be in PDF form, following the LIPIcs guidelines. They can be:

Extended abstracts (up to two pages, excluding references); or
Full papers (up to 15 pages, excluding references).

All submissions will be reviewed by the PC members. A presentation time slot will be given to each accepted submission.

Submission link: https://submissions.floc26.org/ml4sp/

Key Dates

Submission deadline: 15 May 2026 AoE
Result notification: 25 May 2026
Camera ready: 2 July 2026
Workshop day: 18 July 2026

Programme Committe

Shaowei Cai	Chinese Academy of Sciences
Quentin Cappart	Polytechnique Montréal
Wuyang Chen	Simon Fraser University
Pascal Fontaine	LORIA, INRIA, Université de Lorraine
Guy Katz	The Hebrew University of Jerusalem
Sean Holden	Cambridge University
Mikoláš Janota	Czech Technical University
Lars Kotthoff	University of St Andrews
Peter Nightingale	University of York
Martin Suda	Czech Technical University
Dimos Tsouros	University of Western Macedonia
Felix Ulrich-Oltean	University of York
Vijay Ganesh (chair)	Georgia Institute of Technology
Nguyen Dang (chair)	University of St Andrews

Organizers:

Vijay Ganesh, Georgia Tech, vganesh45@gatech.edu
Nguyen Dang, University of St Andrews, nttd@st-andrews.ac.uk

CFP - LLMs meet Constraint Solving, 2nd Edition (LLM-Solve 2026)

Tue, 21 Apr 2026 00:00:00 +0200

CALL FOR PAPERS

LLM-Solve 2026: LLMs meet Constraint Solving (2nd Edition)
FLoC & CP 2026 Workshop
Sunday, July 19, 2026, at ISCTE, Lisbon, Portugal

IMPORTANT DATES

Submission deadline: May 15, 2026
Notification: May 25, 2026
Workshop: July 19, 2026

ABOUT

LLM-Solve 2026 is a workshop for researchers at the intersection of Large Language Models and Constraint Solving (CP, SAT, SMT, MIP, and related paradigms). LLMs now act as agentic systems that orchestrate multi-step reasoning and tool use, yet they struggle with reliability and formal correctness. Constraint solvers offer provable guarantees but require expertise to formalize problems and select suitable techniques. The opportunity is bidirectional. LLMs can help non-experts with modeling and interactive solving, while constraint solvers can provide execution, verification, and structured reasoning for LLM-driven agents.

TOPICS OF INTEREST (not restricted to)

LLMs and agentic systems for constraint modeling and acquisition
LLM-guided solver heuristics and search strategies
Hybrid approaches combining LLMs and constraint solvers
Constraint solvers for improving LLM reasoning and verification
SAT/CP-based methods for controlling or guiding LLM outputs
LLM-driven explanations and interactive constraint solving
Benchmarks, datasets, and evaluation methodologies for LLM-Constraint integration
Real-world applications combining constraint-solving and LLMs

SUBMISSIONS

Extended abstracts up to 2 pages (excluding references), with an optional appendix of up to 10 pages. Submissions may cover published work, original work, work in progress with preliminary results, or position papers. PDF following LIPIcs guidelines. All presenters and attendees must register for the FLoC workshop day.

Submit.

ORGANIZERS

Tias Guns (KU Leuven, Belgium)
Serdar Kadıoglu (Brown University, USA)
Stefan Szeider (TU Wien, Austria)
Dimos Tsouros (UOWM, Greece)

FLoC’26, CP’26

CFP - Soft Constraints, Discrete Optimization, and Machine Learning (SOFT'26)

Wed, 08 Apr 2026 00:00:00 +0200

This workshop aims to bring together researchers on constraint reasoning, optimization, and learning to present recent advances, share ongoing work, and discuss future directions for hybrid approaches that combine discrete optimization with machine learning and data mining.

Topics of Interest (but are not restricted to):

Max-SAT
Max-SMT
Markov Random Field
Pseudo-Boolean Optimization
Soft global constraints
Weighted CSP
Integer Programming
Combining discrete optimization with machine learning for better solver design.
Data-driven strategies to guide search heuristics, branching, or propagation.
Using machine learning and data mining techniques to guide search.
Integrating deep neural networks to improve solvers.

Submissions

The aim of this workshop is to provide a forum where researchers currently working in this area can exchange their ideas, discuss new developments and explore possible future directions. Therefore, we welcome and encourage three types of submission:

1) Work in progress and Original work. Submissions of an extended abstract or a full paper, up to 15 pages in the LIPIcs format (https://submission.dagstuhl.de/series/details/LIPIcs#author), about unpublished ideas will be reviewed by a double-blind process and if accepted and the authors agree the final version will be made available on the workshop website.

1) Already published work. Authors who are interested in giving a presentation to the workshop’s audience may submit their work non-anonymously while indicating where this work has been published. We will only accept work which has been published in the last calendar year (e.g., CPAIOR 2025, CP 2025, ECAI 2025, IJCAI 2025, AAAI 2026, and any journal or conference held after May 2025).

1) Papers not selected for the main CP conference. Decisions about acceptance of these papers will be based on their reviews.

Contributions should be submitted in the form of a PDF file, following LIPIcs guidelines, using the link https://submissions.floc26.org/soft/

The type of submission as defined above should be clearly stated during the submission. At least one author of each accepted paper must attend the workshop.

This workshop is open to all members of the FLoC community. All workshop participants must pay the workshop fee.

Important Dates

Paper Submission deadline May 15th
Notification of acceptance May 28th
Early CP registration deadline June 1st
Final version deadline June 30th
Workshop Date July 24th

Organizers

Simon de Givry
INRAE MIAT, Toulouse, France.
Email: simon.de-givry @ inrae.fr
Web: https://miat.inrae.fr/degivry

Samir Loudni
DAPI, IMT Atlantique, Nantes, France.
Email: samir.loudni @ imt-atlantique.fr
Web: https://cv.hal.science/samir-loudni

Program Committee

Quentin Cappart, UCLouvain, Belgium and Polytechnique Montréal, Canada
Tias Gun, KU Leuven, Belgium
George Katsirelos, INRAE Paris Saclay, France
Elias B. Khalil, University of Toronto, Canada
Javier Larrosa, UPC, Barcelona, Spain
Jakob Nordström, University of Copenhagen, Denmark, and Lund University, Sweden
Albert Oliveras, UPC, Barcelona, Spain
Thomas Schiex, INRAE Toulouse, France
Sylvie Thiebaux, LAAS, Toulouse, France

CFP - Pseudo-Boolean Competition 2026

Wed, 08 Apr 2026 00:00:00 +0200

The 2026 edition of the competition for pseudo-Boolean solvers is organized under the aegis of the SAT 2026 conference. The Pseudo-Boolean Competition 2026 is also affiliated with the FloC Olympic Games.

All the details about this new edition of the competition are available at

https://www.cril.univ-artois.fr/PB26/

The deadline for both solvers and benchmarks submission is May 6, 2026.

Obviously, a competition cannot exist without solvers and benchmarks. So, if you have pseudo-Boolean solvers or benchmarks, please make a submission to the PB26 competition!

On behalf of the steering committee: Carlos Ansótegui, Johannes Klaus Fichte, Jakob Nordström, and Olivier Roussel

CFP - 3rd International Workshop on Highlights in Organizing and Optimizing Proof-logging Systems (WHOOPS'26)

Tue, 07 Apr 2026 00:00:00 +0200

The 3rd International Workshop on Highlights in Organizing and Optimizing Proof-logging Systems (WHOOPS ‘26) will be held on 19th July 2026 as part of the Federated Logic Conference (FLoC ‘26), immediately before the CP and SAT conferences.

The purpose of WHOOPS is to bring together researchers interested in certifying algorithms and proof logging for automated reasoning and combinatorial solving. As such, we solicit contributed talks that will be of interest to such an audience, on topics which could include:

the theory or practice of proof logging systems;
bringing proof logging to existing or new solving tools;
descriptions of challenges anticipated or encountered;
integrating proof logging into larger verification frameworks;
connections between proof logging and explainability;
speculation about or requests for future directions for proof logging and certification.

WHOOPS does not have full papers or proceedings, and presentations may cover work that is already published or that may be published elsewhere in the future. We ask only for a brief (<1 page) abstract, which can be submitted through the FLoC submissions system before the deadline of 15th May 2026.

Background and purpose

Modern automated reasoning has transformed large parts of industry and has also found numerous scientific applications. But many reasoning problems are computationally very challenging, or sometimes even undecidable. Because of this, the algorithms used are getting increasingly complex, and even the most mature tools currently available struggle with incorrect results. As these algorithms are increasingly being used autonomously, sometimes even in life-critical applications, it is urgent to ensure that what they compute is valid. Software testing, while important, has not been sufficient to resolve this problem, and formal verification methods are far from being able to scale to the level of complexity in modern algorithms.

During the last twenty years, the Boolean satisfiability (SAT) solving community has instead spearheaded the use of proof logging, meaning that the SAT solvers have to output, along the answer to a problem, a machine-verifiable proof that this answer is correct. Such solvers are also referred to as certifying algorithms. For a long time, attempts to extend proof logging to stronger paradigms in automated reasoning met with limited success. This has changed in the last few years, however, with proof logging techniques now being developed for a wide range of paradigms such as SAT-based and pseudo-Boolean optimisation, subgraph solving, constraint programming, automated planning, mixed integer linear programming, and even satisfiability modulo theories (SMT) solving and automated theorem proving.

These developments have been so fast that in 2024 the fairly spontaneous idea arose to celebrate the latest advances during an informal workshop, which—reflecting the rather improvised nature of the event—was named the 1st Workshop on Highlights in Organizing and Optimizing Proof-logging Systems (WHOOPS ‘24). The second edition WHOOPS ‘25 was held last autumn under the auspices of EuroProofNet.

The third instalment of the workshop series, to be held on 19th July 2026 as part of the Federated Logic Conference (FLoC ‘26), will continue to expand the range of topics beyond SAT and pseudo-Boolean proof logging to provide a forum for discussing certifying algorithms for automated reasoning more broadly. In addition to ensuring correctness of outputs for automated reasoning algorithms, we also hope to examine the use of proof logging to provide new tools for algorithm development and analysis, software debugging, and even research into explainability in the context of AI.

Program committee

Katalin Fazekas, TU Wien
Daniela Kaufmann, TU Wien
Ciaran McCreesh, University of Glasgow
Jakob Nordström, University of Copenhagen and Lund University
Michael Rawson, University of Southampton
Adrian Rebola-Pardo, TU Wien

Jakob Nordström, Professor University of Copenhagen and Lund University Phone: +45 28 78 38 11 / +46 70 742 21 98 https://jakobnordstrom.se