| 2014 | A (Biased) Proof Complexity Survey for SAT Practitioners. | Jakob Nordstrm |
| 2014 | Impact of Community Structure on SAT Solver Performance. | Zack Newsham, Vijay Ganesh, Sebastian Fischmeister, Gilles Audemard, Laurent Simon |
| 2014 | Ultimately Incremental SAT. | Alexander Nadel, Vadim Ryvchin, Ofer Strichman |
| 2014 | Long Proofs of (Seemingly) Simple Formulas. | Mladen Miksa, Jakob Nordstrm |
| 2014 | Open-WBO: A Modular MaxSAT Solver, . | Ruben Martins, Vasco Manquinho, Ins Lynce |
| 2014 | On Computing Preferred MUSes and MCSes. | Joo Marques-Silva, Alessandro Previti |
| 2014 | Formula partitioning revisited. | Zoltn dm Mann, Pl Andrs Papp |
| 2014 | Typical-case complexity and the SAT competitions. | Zoltn dm Mann |
| 2014 | Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions. | Daniel Larraz, Albert Oliveras, Enric Rodrguez-Carbonell, Albert Rubio |
| 2014 | A SAT Attack on the Erdős Discrepancy Conjecture. | Boris Konev, Alexei Lisitsa |
| 2014 | MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing. | Charles Jordan, Lukasz Kaiser, Florian Lonsing, Martina Seidl |
| 2014 | Conditional Lower Bounds for Failed Literals and Related Techniques. | Matti Jrvisalo, Janne H. Korhonen |
| 2014 | Proof Complexity and the Kneser-Lovsz Theorem. | Gabriel Istrate, Adrian Craciun |
| 2014 | On Reducing Maximum Independent Set to Minimum Satisfiability. | Alexey Ignatiev, Antnio Morgado, Joo Marques-Silva |
| 2014 | Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers. | Steffen Hlldobler, Norbert Manthey, Tobias Philipp, Peter Steinke |
| 2014 | Dominant Controllability Check Using QBF-Solver and Netlist Optimizer. | Tamir Heyman, Dan Smith, Yogesh Mahajan, Lance Leong, Husam Abu-Haimed |
| 2014 | Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers. | Marijn Heule, Norbert Manthey, Tobias Philipp |
| 2014 | Fixed-Parameter Tractable Reductions to SAT. | Ronald de Haan, Stefan Szeider |
| 2014 | An Ising Model Inspired Extension of the Product-Based MP Framework for SAT. | Oliver Gableske |
| 2014 | iDQ: Instantiation-Based DQBF Solving. | Andreas Frhlich, Gergely Kovsznai, Armin Biere, Helmut Veith |
| 2014 | Fast DQBF Refutation. | Bernd Finkbeiner, Leander Tentrup |
| 2014 | Simplifying Pseudo-Boolean Constraints in Residual Number Systems. | Yoav Fekete, Michael Codish |
| 2014 | Automatic Evaluation of Reductions between NP-Complete Problems. | Carles Creus, Pau Fernndez, Guillem Godoy |
| 2014 | Hypergraph Acyclicity and Propositional Model Counting. | Florent Capelli, Arnaud Durand, Stefan Mengel |
| 2014 | Approximating Highly Satisfiable Random 2-SAT. | Andrei A. Bulatov, Cong Wang |