Abstract is missing.
- Probabilistic Model Counting with Short XORsDimitris Achlioptas, Panos Theodoropoulos. 3-19 [doi]
- Backdoor Treewidth for SATRobert Ganian, M. S. Ramanujan, Stefan Szeider. 20-37 [doi]
- New Width Parameters for Model CountingRobert Ganian, Stefan Szeider. 38-52 [doi]
- Hard Satisfiable Formulas for Splittings by Linear CombinationsDmitry Itsykson, Alexander Knop. 53-61 [doi]
- On the Community Structure of Bounded Model Checking SAT ProblemsGuillaume Baud-Berthier, Jesús Giráldez-Cru, Laurent Simon. 65-82 [doi]
- Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SATJo Devriendt, Bart Bogaerts 0001, Maurice Bruynooghe. 83-100 [doi]
- An Adaptive Prefix-Assignment Technique for Symmetry ReductionTommi A. Junttila, Matti Karppa, Petteri Kaski, Jukka Kohonen. 101-118 [doi]
- An Empirical Study of Branching Heuristics Through the Lens of Global Learning RateJia Hui Liang, Hari Govind V. K., Pascal Poupart, Krzysztof Czarnecki, Vijay Ganesh. 119-135 [doi]
- Coverage-Based Clause Reduction Heuristics for CDCL SolversHidetomo Nabeshima, Katsumi Inoue. 136-144 [doi]
- (I Can Get) Satisfaction: Preference-Based Scheduling for Concert-Goers at Multi-venue Music FestivalsEldan Cohen, Guoyu Huang, J. Christopher Beck. 147-163 [doi]
- On Tackling the Limits of Resolution in SAT SolvingAlexey Ignatiev, António Morgado, Joao Marques-Silva. 164-183 [doi]
- Improving MCS Enumeration via CachingAlessandro Previti, Carlos Mencía, Matti Järvisalo, Joao Marques-Silva. 184-194 [doi]
- Introducing Pareto Minimal Correction SubsetsMiguel Terra-Neves, Inês Lynce, Vasco M. Manquinho. 195-211 [doi]
- A Distributed Version of SyrupGilles Audemard, Jean-Marie Lagniez, Nicolas Szczepanski, Sébastien Tabary. 215-232 [doi]
- PaInleSS: A Framework for Parallel SAT SolvingLudovic Le Frioux, Souheib Baarir, Julien Sopena, Fabrice Kordon. 233-250 [doi]
- A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer SolversSaeed Nejati, Zack Newsham, Joseph Scott, Jia Hui Liang, Catherine H. Gebotys, Pascal Poupart, Vijay Ganesh. 251-260 [doi]
- Shortening QBF Proofs with Dependency SchemesJoshua Blinkhorn, Olaf Beyersdorff. 263-280 [doi]
- A Little Blocked Literal Goes a Long WayBenjamin Kiesl, Marijn J. H. Heule, Martina Seidl. 281-297 [doi]
- Dependency Learning for QBFTomás Peitl, Friedrich Slivovsky, Stefan Szeider. 298-313 [doi]
- A Resolution-Style Proof System for DQBFMarkus N. Rabe. 314-325 [doi]
- From DQBF to QBF by Dependency EliminationRalf Wimmer, Andreas Karrenbauer, Ruben Becker, Christoph Scholl, Bernd Becker 0001. 326-343 [doi]
- Theory Refinement for Program VerificationAntti E. J. Hyvärinen, Sepideh Asadi, Karine Even Mendoza, Grigory Fedyukovich, Hana Chockler, Natasha Sharygina. 347-363 [doi]
- On Simplification of Formulas with Unconstrained Variables and QuantifiersMartin Jonás, Jan Strejcek. 364-379 [doi]
- A Benders Decomposition Approach to Deciding Modular Linear Integer ArithmeticBishoksan Kafle, Graeme Gange, Peter Schachte, Harald Søndergaard, Peter J. Stuckey. 380-397 [doi]
- SAT-Based Local Improvement for Finding Tree Decompositions of Small WidthJohannes Klaus Fichte, Neha Lodha, Stefan Szeider. 401-411 [doi]
- A Lower Bound on CNF Encodings of the At-Most-One ConstraintPetr Kucera, Petr Savický, Vojtech Vorel. 412-428 [doi]
- SAT-Encodings for Special Treewidth and PathwidthNeha Lodha, Sebastian Ordyniak, Stefan Szeider. 429-445 [doi]
- MaxPre: An Extended MaxSAT PreprocessorTuukka Korhonen, Jeremias Berg, Paul Saikko, Matti Järvisalo. 449-456 [doi]
- The GRAT Tool Chain - Efficient (UN)SAT Certificate Checking with Formal Correctness GuaranteesPeter Lammich. 457-463 [doi]
- CNFgen: A Generator of Crafted BenchmarksMassimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals. 464-473 [doi]