- 2024
- Olaf Beyersdorff, Judith Clymo, Stefan S. Dantchev, Barnaby Martin:
The Riis Complexity Gap for QBF Resolution. J. Satisf. Boolean Model. Comput. 15(1): 9-25 (2024) - Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann:
Proof Complexity of Propositional Model Counting. J. Satisf. Boolean Model. Comput. 15(1): 27-59 (2024) - Alexander Nadel:
TT-Open-WBO-Inc: An Efficient Anytime MaxSAT Solver. J. Satisf. Boolean Model. Comput. 15(1): 1-7 (2024) - 2023
- Evgeny Dantsin, Alexander Wolpert:
An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF. J. Satisf. Boolean Model. Comput. 14(1): 1-15 (2023) - Francesco Leofante
:
OMTPlan: A Tool for Optimal Planning Modulo Theories. J. Satisf. Boolean Model. Comput. 14(1): 17-23 (2023) - 2022
- Stefan Mengel:
No Efficient Disjunction or Conjunction of Switch-Lists. J. Satisf. Boolean Model. Comput. 13(1): 1-4 (2022) - 2020
- Jan Johannsen:
Backdoors into Two Occurrences. J. Satisf. Boolean Model. Comput. 12(1): 1-15 (2020) - Alexander Nadel:
Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT. J. Satisf. Boolean Model. Comput. 12(1): 17-22 (2020) - 2019
- Fahiem Bacchus, Matti Järvisalo, Ruben Martins:
MaxSAT Evaluation 2018: New Developments and Detailed Results. J. Satisf. Boolean Model. Comput. 11(1): 99-131 (2019) - Marijn J. H. Heule, Matti Järvisalo, Martin Suda:
SAT Competition 2018. J. Satisf. Boolean Model. Comput. 11(1): 133-154 (2019) - Alexey Ignatiev, António Morgado, João Marques-Silva:
RC2: an Efficient MaxSAT Solver. J. Satisf. Boolean Model. Comput. 11(1): 53-64 (2019) - Saurabh Joshi, Prateek Kumar, Sukrut Rao, Ruben Martins:
Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT. J. Satisf. Boolean Model. Comput. 11(1): 73-97 (2019) - William Klieber:
GhostQ. J. Satisf. Boolean Model. Comput. 11(1): 65-72 (2019) - Florian Lonsing:
QBFRelay, QRATPre+, and DepQBF: Incremental Preprocessing Meets Search-Based QBF Solving. J. Satisf. Boolean Model. Comput. 11(1): 211-220 (2019) - Tomás Peitl, Friedrich Slivovsky, Stefan Szeider:
Qute in the QBF Evaluation 2018. J. Satisf. Boolean Model. Comput. 11(1): 261-272 (2019) - Luca Pulina, Martina Seidl:
Notes from the Guest Editors. J. Satisf. Boolean Model. Comput. 11(1): 1 (2019) - Leander Tentrup:
CAQE and QuAbS: Abstraction Based QBF Solvers. J. Satisf. Boolean Model. Comput. 11(1): 155-210 (2019) - Tjark Weber, Sylvain Conchon, David Déharbe, Matthias Heizmann, Aina Niemetz, Giles Reger:
The SMT Competition 2015-2018. J. Satisf. Boolean Model. Comput. 11(1): 221-259 (2019) - Ralf Wimmer, Christoph Scholl, Bernd Becker:
The (D)QBF Preprocessor HQSpre - Underlying Theory and Its Implementation. J. Satisf. Boolean Model. Comput. 11(1): 3-52 (2019) - 2016
- Srinivasan Arunachalam, Ilias S. Kotsireas:
Hard satisfiable 3-SAT instances via autocorrelation. J. Satisf. Boolean Model. Comput. 10(1): 11-22 (2016) - Sam Buss, Jan Johannsen:
On Linear Resolution. J. Satisf. Boolean Model. Comput. 10(1): 23-35 (2016) - Mikolas Janota:
On Exponential Lower Bounds for Partially Ordered Resolution. J. Satisf. Boolean Model. Comput. 10(1): 1-9 (2016) - Patrick Scharpfenecker, Jacobo Torán:
Solution-Graphs of Boolean Formulas and Isomorphism. J. Satisf. Boolean Model. Comput. 10(1): 37-58 (2016) - 2014
- André Abramé, Djamal Habet:
Ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver. J. Satisf. Boolean Model. Comput. 9(1): 89-128 (2014) - Daniel Le Berre, Stéphanie Roussel:
Sat4j 2.3.2: on the fly solver configuration System Description. J. Satisf. Boolean Model. Comput. 8(3/4): 197-202 (2014) - Gianpiero Cabodi, Carmelo Loiacono, Marco Palena, Paolo Pasini, Denis Patti, Stefano Quer, Danilo Vendraminetto, Armin Biere, Keijo Heljanko:
Hardware Model Checking Competition 2014: An Analysis and Comparison of Solvers and Benchmarks. J. Satisf. Boolean Model. Comput. 9(1): 135-172 (2014) - David R. Cok, David Déharbe, Tjark Weber:
The 2014 SMT Competition. J. Satisf. Boolean Model. Comput. 9(1): 207-242 (2014) - Mikolas Janota:
MiFuMax - a Literate MaxSAT Solver. J. Satisf. Boolean Model. Comput. 9(1): 83-88 (2014) - Mikolas Janota, Charles Jordan, Will Klieber, Florian Lonsing, Martina Seidl, Allen Van Gelder:
The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games. J. Satisf. Boolean Model. Comput. 9(1): 187-206 (2014) - Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Reweighted Belief Propagation and Quiet Planting for Random K-SAT. J. Satisf. Boolean Model. Comput. 8(3/4): 149-171 (2014)
