| 2014 | A (Biased) Proof Complexity Survey for SAT Practitioners. Jakob Nordström |
| 2014 | A SAT Attack on the Erdős Discrepancy Conjecture. Boris Konev, Alexei Lisitsa |
| 2014 | An Ising Model Inspired Extension of the Product-Based MP Framework for SAT. Oliver Gableske |
| 2014 | Approximating Highly Satisfiable Random 2-SAT. Andrei A. Bulatov, Cong Wang |
| 2014 | Automatic Evaluation of Reductions between NP-Complete Problems. Carles Creus, Pau Fernández, Guillem Godoy |
| 2014 | Community Branching for Parallel Portfolio SAT Solvers. Tomohiro Sonobe, Shuya Kondoh, Mary Inaba |
| 2014 | Conditional Lower Bounds for Failed Literals and Related Techniques. Matti Järvisalo, Janne H. Korhonen |
| 2014 | Cores in Core Based MaxSat Algorithms: An Analysis. Fahiem Bacchus, Nina Narodytska |
| 2014 | DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs. Nathan Wetzler, Marijn Heule, Warren A. Hunt Jr. |
| 2014 | Detecting Cardinality Constraints in CNF. Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey |
| 2014 | Dominant Controllability Check Using QBF-Solver and Netlist Optimizer. Tamir Heyman, Dan Smith, Yogesh Mahajan, Lance Leong, Husam Abu-Haimed |
| 2014 | Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask). Tomás Balyo, Andreas Fröhlich, Marijn Heule, Armin Biere |
| 2014 | Fast DQBF Refutation. Bernd Finkbeiner, Leander Tentrup |
| 2014 | Fixed-Parameter Tractable Reductions to SAT. Ronald de Haan, Stefan Szeider |
| 2014 | Hypergraph Acyclicity and Propositional Model Counting. Florent Capelli, Arnaud Durand, Stefan Mengel |
| 2014 | Impact of Community Structure on SAT Solver Performance. Zack Newsham, Vijay Ganesh, Sebastian Fischmeister, Gilles Audemard, Laurent Simon |
| 2014 | Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses. Adrian Balint, Armin Biere, Andreas Fröhlich, Uwe Schöning |
| 2014 | Lazy Clause Exchange Policy for Parallel SAT Solvers. Gilles Audemard, Laurent Simon |
| 2014 | Long Proofs of (Seemingly) Simple Formulas. Mladen Miksa, Jakob Nordström |
| 2014 | MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing. Charles Jordan, Lukasz Kaiser, Florian Lonsing, Martina Seidl |
| 2014 | MUS Extraction Using Clausal Proofs. Anton Belov, Marijn Heule, João Marques-Silva |
| 2014 | Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions. Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio |
| 2014 | On Computing Preferred MUSes and MCSes. João Marques-Silva, Alessandro Previti |
| 2014 | On Reducing Maximum Independent Set to Minimum Satisfiability. Alexey Ignatiev, António Morgado, João Marques-Silva |
| 2014 | Open-WBO: A Modular MaxSAT Solver, . Ruben Martins, Vasco Manquinho, Inês Lynce |
| 2014 | Proof Complexity and the Kneser-Lovász Theorem. Gabriel Istrate, Adrian Craciun |
| 2014 | QBF Resolution Systems and Their Proof Complexities. Valeriy Balabanov, Magdalena Widl, Jie-Hong R. Jiang |
| 2014 | Simplifying Pseudo-Boolean Constraints in Residual Number Systems. Yoav Fekete, Michael Codish |
| 2014 | Solving MaxSAT and #SAT on Structured CNF Formulas. Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle |
| 2014 | Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki |
| 2014 | Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings Carsten Sinz, Uwe Egly |
| 2014 | Ultimately Incremental SAT. Alexander Nadel, Vadim Ryvchin, Ofer Strichman |
| 2014 | Unified Characterisations of Resolution Hardness Measures. Olaf Beyersdorff, Oliver Kullmann |
| 2014 | Variable Dependencies and Q-Resolution. Friedrich Slivovsky, Stefan Szeider |