


default search action
Journal on Satisfiability, Boolean Modeling and Computation, Volume 9
Volume 9, Number 1, 2014
- Frédéric Lafitte, Jorge Nakahara Jr., Dirk Van Heule:

Applications of SAT Solvers in Cryptanalysis: Finding Weak Keys and Preimages. 1-25 - Alexander Nadel, Vadim Ryvchin, Ofer Strichman:

Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores. 27-51
- Aina Niemetz, Mathias Preiner

, Armin Biere:
Boolector 2.0. 53-58 - Ruben Martins, Saurabh Joshi, Vasco Manquinho, Inês Lynce:

On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving. 59-81 - Mikolas Janota:

MiFuMax - a Literate MaxSAT Solver. 83-88 - André Abramé, Djamal Habet:

Ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver. 89-128 - António Morgado, Alexey Ignatiev, João Marques-Silva:

MSCG: Robust Core-Guided MaxSAT Solving. 129-134 - 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. 135-172 - Mihaela Sighireanu, David R. Cok:

Report on SL-COMP 2014. 173-186 - Mikolas Janota, Charles Jordan, Will Klieber, Florian Lonsing, Martina Seidl, Allen Van Gelder:

The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games. 187-206 - David R. Cok, David Déharbe, Tjark Weber:

The 2014 SMT Competition. 207-242

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














