- Frédéric Lafitte, Jorge Nakahara Jr., Dirk Van Heule:
Applications of SAT Solvers in Cryptanalysis: Finding Weak Keys and Preimages. J. Satisf. Boolean Model. Comput. 9(1): 1-25 (2014) - Ruben Martins, Saurabh Joshi, Vasco Manquinho, Inês Lynce:
On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving. J. Satisf. Boolean Model. Comput. 9(1): 59-81 (2014) - António Morgado, Alexey Ignatiev, João Marques-Silva:
MSCG: Robust Core-Guided MaxSAT Solving. J. Satisf. Boolean Model. Comput. 9(1): 129-134 (2014) - Alexander Nadel, Vadim Ryvchin, Ofer Strichman:
Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores. J. Satisf. Boolean Model. Comput. 9(1): 27-51 (2014) - Aina Niemetz, Mathias Preiner
, Armin Biere:
Boolector 2.0. J. Satisf. Boolean Model. Comput. 9(1): 53-58 (2014) - Konrad W. Schwerdtfeger:
A Computational Trichotomy for Connectivity of Boolean Satisfiability. J. Satisf. Boolean Model. Comput. 8(3/4): 173-195 (2014) - Mihaela Sighireanu, David R. Cok:
Report on SL-COMP 2014. J. Satisf. Boolean Model. Comput. 9(1): 173-186 (2014) - Sean A. Weaver, Katrina J. Ray, Victor W. Marek, Andrew J. Mayer, Alden Walker:
Satisfiability-based Set Membership Filters. J. Satisf. Boolean Model. Comput. 8(3/4): 129-148 (2014) - 2012
- Francesco Alberti, Silvio Ghilardi, Elena Pagani, Silvio Ranise, Gian Paolo Rossi:
Universal Guards, Relativization of Quantifiers, and Failure Models in Model Checking Modulo Theories. J. Satisf. Boolean Model. Comput. 8(1/2): 29-61 (2012) - Anton Belov, João Marques-Silva:
MUSer2: An Efficient MUS Extractor. J. Satisf. Boolean Model. Comput. 8(3/4): 123-128 (2012) - Uwe Bubeck, Hans Kleine Büning:
Encoding Nested Boolean Functions as Quantified Boolean Formulas. J. Satisf. Boolean Model. Comput. 8(1/2): 101-116 (2012) - Huan Chen, João Marques-Silva:
TG-Pro: A SAT-based ATPG System. J. Satisf. Boolean Model. Comput. 8(1/2): 83-88 (2012) - Allen Van Gelder:
Contrasat - A Contrarian SAT Solver. J. Satisf. Boolean Model. Comput. 8(3/4): 117-122 (2012) - Alberto Griggio:
A Practical Approach to Satisability Modulo Linear Integer Arithmetic. J. Satisf. Boolean Model. Comput. 8(1/2): 1-27 (2012) - Mikolás Janota, Inês Lynce, Vasco Manquinho, João Marques-Silva:
PackUp: Tools for Package Upgradability Solving. J. Satisf. Boolean Model. Comput. 8(1/2): 89-94 (2012) - Miyuki Koshimura, Tong Zhang, Hiroshi Fujita, Ryuzo Hasegawa:
QMaxSAT: A Partial Max-SAT Solver. J. Satisf. Boolean Model. Comput. 8(1/2): 95-100 (2012) - Marcel Wild:
Compactly Generating All Satisfying Truth Assignments of a Horn Formula. J. Satisf. Boolean Model. Comput. 8(1/2): 63-82 (2012) - 2011
- Magnus Björk:
Successful SAT Encoding Techniques. J. Satisf. Boolean Model. Comput. 7(4): 189-201 (2011) - Youssef Hamadi, Saïd Jabbour, Cédric Piette, Lakhdar Sais:
Deterministic Parallel DPLL. J. Satisf. Boolean Model. Comput. 7(4): 127-132 (2011) - Steve Haynal, Heidi Haynal:
Generating and Searching Families of FFT Algorithms. J. Satisf. Boolean Model. Comput. 7(4): 145-187 (2011) - Olivier Roussel:
Controlling a Solver Execution with the runsolver Tool. J. Satisf. Boolean Model. Comput. 7(4): 139-144 (2011) - Peter van der Tak, Antonio Ramos, Marijn Heule:
Reusing the Assignment Trail in CDCL Solvers. J. Satisf. Boolean Model. Comput. 7(4): 133-138 (2011) - 2010
- Adrian Balint, Daniel Gall, Gregor Kapler, Robert Retz:
Experiment design and administration for computer clusters for SAT-solvers (EDACC). J. Satisf. Boolean Model. Comput. 7(2-3): 77-82 (2010) - Daniel Le Berre, Anne Parrain:
The Sat4j library, release 2.2. J. Satisf. Boolean Model. Comput. 7(2-3): 59-6 (2010) - Enrico Giunchiglia, Paolo Marin, Massimo Narizzano:
QuBE7.0. J. Satisf. Boolean Model. Comput. 7(2-3): 83-88 (2010) - Federico Heras, David Bañeres:
The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers. J. Satisf. Boolean Model. Comput. 7(2-3): 89-126 (2010) - Jiwei Jin, Xishun Zhao:
Resolution on Quantified Generalized Clause-sets.. J. Satisf. Boolean Model. Comput. 7(1): 17-34 (2010) - Marina Langlois, Robert H. Sloan, György Turán:
Horn Upper Bounds and Renaming. J. Satisf. Boolean Model. Comput. 7(1): 1-15 (2010) - Florian Lonsing, Armin Biere:
DepQBF: A Dependency-Aware QBF Solver. J. Satisf. Boolean Model. Comput. 7(2-3): 71-76 (2010) - Luca Pulina, Armando Tacchella:
AQME'10. J. Satisf. Boolean Model. Comput. 7(2-3): 65-70 (2010)
