14th Pragmatics of SAT international workshop

a workshop of the 26th International Conference on Theory and Applications of Satisfiability Testing

July 4, 2023, Alghero, Italy

May 27, 2023: Accepted presentations unveiled.
May 2, 2023: Paper submission deadline extended to May 9.
February 24, 2023: Web site is up.

Scientific context


The aim of the Pragmatics of SAT (PoS) workshop series is to provide a venue for researchers working on designing and/or applying Boolean satisfiability (SAT) solvers and related solver technologies, including but not restricting to satisfiability modulo theories (SMT), answer set programming (ASP), and constraint programming (CP) as well as their optimization counterparts, to meet, communicate, and discuss latest results.


The success of solver technologies for declarative languages, such as SAT, in the last two decades is mainly due to both the availability of numerous efficient solver implementations and to the growing number of problems that can efficiently be solved through the declarative approach. Designing efficient solvers requires both understanding of the fundamental algorithms underlying the solvers, as well as in-depth insights into how to implement the algorithms for obtaining efficient and robust solvers.

Several competitive events are regularly organized for different declarative solving paradigms, including SAT competitions, QBF evaluations, MaxSAT evaluations, SMT, ASP and CP competitions, etc., to evaluate available solvers on a wide range of problems. The winners of such events set regularly new standards in the area. If the systems themselves are widely spread, many details on their design or in their implementation can only be found in the source code of the systems.

The aim of the workshop is to allow researchers to share both fundamental theoretical insights into practical solvers, as well as new implementation-level insights and 'gory' technical details about their systems that may at times be difficult to publish in the main conferences on the declarative solving paradigms.


The first edition of PoS took place during FLoC 2010. The second edition took place before SAT 2011, in Ann Arbor. The third edition took place on June 16, 2012, between the second SAT/SMT Summer School (June 12 to 15) and the SAT conference (June 17-20). The fourth edition took place on July 8, once again between the SAT/SMT summer school and the SAT conference. The fifth edition took place during the Vienna Summer of Logic, just before the SAT conference. The sixth edition took place before the SAT conference, in Austin. The seventh edition took place before the SAT conference, in Bordeaux. The eighth edition, colocated with CP and ICLP, was organized on a more general topic of ``Pragmatics of Constraint Reasoning". The ninth edition took place during the Federated Logic Conference in Oxford. The decade edition took place in Lisbon. The eleventh edition was fully virtual due to COVID19. The twelfth edition was mostly virtual for the same reason. The thirteenth edition ran for the fourth time during FLoC in Haifa.

The 2023 edition is thus the fourteenth edition of the workshop dedicated to the practical aspects of SAT research.


Main areas of interest include, but are not restricted to:


The workshop will take place on July 4, 2023.


Registration to the workshop will be available from SAT'23 web site.


The workshop welcomes several categories of submissions:

Each submission will be reviewed by at least three members of the programme committee.

The papers must be submitted electronically through EasyChair as a PDF file using the CEURART one column style.

Authors should provide enough information and/or data for reviewers to confirm any performance claims. This includes links to a runnable system, access to benchmarks, reference to a public performance results, etc.

If enough original and position papers are accepted to the workshop (6+), we will have the opportunity to publish those papers on CEUR-WS proceedings. The papers will be made available open access under the CC BY 4.0 license after the workshop to allow the authors to take into account the feedback received during the workshop.

This year, considering the very tight schedule between the main SAT conference authors notification (May 15) and the workshop (July 4), we will allow a SAT fast track for original papers, i.e. papers that do not make it to SAT on topics related to PoS will have the opportunity to be submitted late to PoS as original papers. In this case, reviewing for PoS will mostly be focused on the SAT reviews.

Important dates

The deadlines have been decided to allow the authors to get notified by the early registration deadline. Note that Alghero is a highly demanded venue during summer so it is important to book both travel and stay as early as possible.

Accepted presentations

Jan Gorzny . Towards Satisfactory Web3 Software Engineering Position
Mathias Fleury and Daniela Kaufmann . Lifespan of SAT techniques Position
Shunji Nishimura . Approximate-At-Most-k Encoding of SAT for Soft Constraints
Tobias Paxian and Armin Biere . Uncovering and Classifying Bugs in MaxSAT Solvers through Fuzzing and Delta Debugging
Jeremias Berg, Bart Bogaerts, Jakob Nordström, Andy Oertel and Dieter Vandesande . Certified Core-Guided MaxSAT Solving
Sebastiaan Brand, Tim Coopmans and Alfons Laarman . Quantum graph-state transformation with SAT
Armin Biere , Mathias Fleury , Nils Froleyks and Marijn Heule . The SAT Museum Position
Alexander Hoen, Ambros Gleixner and Jakob Nordström . On Performance Variability in Pseudo-Boolean Solving and the Impact of Trivial Model Simplifications
Gioni Mexi, Timo Berthold, Ambros Gleixner and Jakob Nordström . Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning
Yoichiro Iida, Tomohiro Sonobe and Mary Inaba . An Empirical Study of the Effect of Learnt Clause on the Structural Measures of SAT problems
Jakob Nordstrom . A one-size-fits-all proof logging system? Position
Anthony Blomme, Daniel Le Berre , Anne Parrain and Olivier Roussel . Compressing UNSAT Search Trees with Caching: an update
Julian Danner, Bernhard Andraschko and Martin Kreuzer . Towards Efficient SAT Solving using XOR-OR-AND Normal Forms
Benjamin Kaiser , Robert Clausecker and Michael Mavroskoufis . Prioritised Unit Propagation by Partitioning the Watch Lists
Vincent Vallade, Julien Sopena and Souheib Baarir . Enhancing State-of-the-Art Parallel SAT Solvers Through Optimized Sharing Policies

Programme Committee


For any questions related to the workshop, the preferred solution to contact the organizers is to send an email to pos at pragmaticsofsat.org.

Matti Järvisalo                               Daniel Le Berre
University of Helsinki                        Universite d'Artois
Department of Computer Science / HIIT         CNRS
P.O. Box 68, FI-00014, Finland                Rue Jean Souvraz SP 18 62307 Lens FRANCE
https://www.cs.helsinki.fi/u/mjarvisa/        http://www.cril.fr/~leberre