Abstract is missing.
- A (Biased) Proof Complexity Survey for SAT PractitionersJakob Nordström. 1-6 [doi]
- Cores in Core Based MaxSat Algorithms: An AnalysisFahiem Bacchus, Nina Narodytska. 7-15 [doi]
- Solving MaxSAT and #SAT on Structured CNF FormulasSigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle. 16-31 [doi]
- Solving Sparse Instances of Max SAT via Width Reduction and Greedy RestrictionTakayuki Sakai, Kazuhisa Seto, Suguru Tamaki. 32-47 [doi]
- MUS Extraction Using Clausal ProofsAnton Belov, Marijn J. H. Heule, Joao Marques-Silva. 48-57 [doi]
- On Computing Preferred MUSes and MCSesJoao Marques-Silva, Alessandro Previti. 58-74 [doi]
- Conditional Lower Bounds for Failed Literals and Related TechniquesMatti Järvisalo, Janne H. Korhonen. 75-84 [doi]
- Fixed-Parameter Tractable Reductions to SATRonald de Haan, Stefan Szeider. 85-102 [doi]
- On Reducing Maximum Independent Set to Minimum SatisfiabilityAlexey Ignatiev, António Morgado, João Marques-Silva. 103-120 [doi]
- Long Proofs of (Seemingly) Simple FormulasMladen Miksa, Jakob Nordström. 121-137 [doi]
- Proof Complexity and the Kneser-Lovász TheoremGabriel Istrate, Adrian Craciun. 138-153 [doi]
- QBF Resolution Systems and Their Proof ComplexitiesValeriy Balabanov, Magdalena Widl, Jie-Hong R. Jiang. 154-169 [doi]
- Unified Characterisations of Resolution Hardness MeasuresOlaf Beyersdorff, Oliver Kullmann. 170-187 [doi]
- Community Branching for Parallel Portfolio SAT SolversTomohiro Sonobe, Shuya Kondoh, Mary Inaba. 188-196 [doi]
- Lazy Clause Exchange Policy for Parallel SAT SolversGilles Audemard, Laurent Simon. 197-205 [doi]
- Ultimately Incremental SATAlexander Nadel, Vadim Ryvchin, Ofer Strichman. 206-218 [doi]
- A SAT Attack on the Erdős Discrepancy ConjectureBoris Konev, Alexei Lisitsa. 219-226 [doi]
- Dominant Controllability Check Using QBF-Solver and Netlist OptimizerTamir Heyman, Dan Smith, Yogesh Mahajan, Lance Leong, Husam Abu-Haimed. 227-242 [doi]
- Fast DQBF RefutationBernd Finkbeiner, Leander Tentrup. 243-251 [doi]
- Impact of Community Structure on SAT Solver PerformanceZack Newsham, Vijay Ganesh, Sebastian Fischmeister, Gilles Audemard, Laurent Simon. 252-268 [doi]
- Variable Dependencies and Q-ResolutionFriedrich Slivovsky, Stefan Szeider. 269-284 [doi]
- Detecting Cardinality Constraints in CNFArmin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey. 285-301 [doi]
- Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long ClausesAdrian Balint, Armin Biere, Andreas Fröhlich, Uwe Schöning. 302-316 [doi]
- Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask)Tomas Balyo, Andreas Fröhlich, Marijn Heule, Armin Biere. 317-332 [doi]
- Minimal-Model-Guided Approaches to Solving Polynomial Constraints and ExtensionsDaniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio. 333-350 [doi]
- Simplifying Pseudo-Boolean Constraints in Residual Number SystemsYoav Fekete, Michael Codish. 351-366 [doi]
- An Ising Model Inspired Extension of the Product-Based MP Framework for SATOliver Gableske. 367-383 [doi]
- Approximating Highly Satisfiable Random 2-SATAndrei A. Bulatov, Cong Wang 0002. 384-398 [doi]
- Hypergraph Acyclicity and Propositional Model CountingFlorent Capelli, Arnaud Durand, Stefan Mengel. 399-414 [doi]
- Automatic Evaluation of Reductions between NP-Complete ProblemsCarles Creus, Pau Fernández, Guillem Godoy. 415-421 [doi]
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal ProofsNathan Wetzler, Marijn Heule, Warren A. Hunt Jr.. 422-429 [doi]
- MPIDepQBF: Towards Parallel QBF Solving without Knowledge SharingCharles Jordan, Lukasz Kaiser, Florian Lonsing, Martina Seidl. 430-437 [doi]
- Open-WBO: A Modular MaxSAT Solver, Ruben Martins, Vasco M. Manquinho, Inês Lynce. 438-445 [doi]