- Alexander Nadel. TT-Open-WBO-Inc: An Efficient Anytime MaxSAT Solver. JSAT, 15(1):1-7, 2024.
- Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann. Proof Complexity of Propositional Model Counting. JSAT, 15(1):27-59, 2024.
- Olaf Beyersdorff, Judith Clymo, Stefan S. Dantchev, Barnaby Martin. The Riis Complexity Gap for QBF Resolution. JSAT, 15(1):9-25, 2024.
- Evgeny Dantsin, Alexander Wolpert. An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF. JSAT, 14(1):1-15, 2023.
- Francesco Leofante. OMTPlan: A Tool for Optimal Planning Modulo Theories. JSAT, 14(1):17-23, January 2023.
- Stefan Mengel. No Efficient Disjunction or Conjunction of Switch-Lists. JSAT, 13(1):1-4, 2022.
- Alexander Nadel. Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT. JSAT, 12(1):17-22, 2020.
- Jan Johannsen. Backdoors into Two Occurrences. JSAT, 12(1):1-15, 2020.
- William Klieber. GhostQ. JSAT, 11(1):65-72, 2019.
- Saurabh Joshi 0001, Prateek Kumar 0001, Sukrut Rao, Ruben Martins. Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT. JSAT, 11(1):73-97, 2019.