SAtRes    News    Accepted publications at JAR, SoCS, and SAT

Accepted publications at JAR, SoCS, and SAT

May 30, 2025

We are happy to announce that works of ours have been accepted for publication at Journal of Automated Reasoning (JAR), Symposium on Combinatorial Search (SoCS) 2025, and Theory & Applications of Satisfiability Testing (SAT) 2025.

• The article Producing Proofs of Unsatisfiability with Distributed Clause-Sharing SAT Solvers, just published at JAR, is a significantly extended version of our TACAS'23 publication that emerged from a cooperation with scientists from Amazon, CMU, and Univ. Minnesota. It presents the cutting-edge setup for producing independently verifiable proofs of unsatisfiability with distributed SAT solving.
• The paper From Scalable SAT to MaxSAT: Massively parallel Solution Improving Search, accepted for publication at SoCS 2025 (authors’ accepted manuscript available here), presents the first massively parallel approach to general MaxSAT solving, based on solution improving search (SIS) combined with distributed SAT solving and task parallelism in Mallob. This is joint work with Jeremias Berg and Christoph Jabs (both University Helsinki, Finland).
• The paper Streamlining Distributed SAT Solver Design, accepted at SAT 2025 (preprint available here), is a joint work with Armin Biere (University of Freiburg). It describes our latest findings in the direction of a clean and focused architecture for large-scale SAT solving via clause sharing.

Find all our works at our publications page!