Abstract is missing.
- Connecting SAT Algorithms and Complexity Lower BoundsRyan Williams. 1-2 [doi]
- Concolic Testing and Constraint SatisfactionKoushik Sen. 3-4 [doi]
- Parameterized Complexity of DPLL Search ProceduresOlaf Beyersdorff, Nicola Galesi, Massimo Lauria. 5-18 [doi]
- Satisfiability Certificates Verifiable in Subexponential TimeEvgeny Dantsin, Edward A. Hirsch. 19-32 [doi]
- On Variables with Few Occurrences in Conjunctive Normal FormsOliver Kullmann, Xishun Zhao. 33-46 [doi]
- Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider. 47-60 [doi]
- BDDs for Pseudo-Boolean Constraints - RevisitedIgnasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell. 61-75 [doi]
- DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic FunctionsAlexey Ignatiev, Alexander Semenov. 76-89 [doi]
- ::::π::::DD: A New Decision Diagram for Efficient Problem Solving in Permutation SpaceShin-ichi Minato. 90-104 [doi]
- How to Apply SAT-Solving for the Equivalence Test of Monotone Normal FormsMartin Mundhenk, Robert Zeranski. 105-119 [doi]
- Enumerating All Solutions of a Boolean CSP by Non-decreasing WeightNadia Creignou, Frédéric Olive, Johannes Schmidt. 120-133 [doi]
- A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level GraphsEwald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen. 134-144 [doi]
- Minimally Unsatisfiable Boolean CircuitsAnton Belov, João P. Marques Silva. 145-158 [doi]
- On Improving MUS Extraction AlgorithmsJoão P. Marques Silva, Inês Lynce. 159-173 [doi]
- Faster Extraction of High-Level Minimal Unsatisfiable CoresVadim Ryvchin, Ofer Strichman. 174-187 [doi]
- On Freezing and Reactivating Learnt ClausesGilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais. 188-200 [doi]
- Efficient CNF Simplification Based on Binary Implication GraphsMarijn Heule, Matti Järvisalo, Armin Biere. 201-215 [doi]
- Between Restarts and BackjumpsAntonio Ramos, Peter van der Tak, Marijn Heule. 216-229 [doi]
- Abstraction-Based Algorithm for 2QBFMikolás Janota, João P. Marques Silva. 230-244 [doi]
- Transformations into Normal Forms for Quantified CircuitsHans Kleine Büning, Xishun Zhao, Uwe Bubeck. 245-258 [doi]
- Failed Literal Detection for QBFFlorian Lonsing, Armin Biere. 259-272 [doi]
- Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given OneIgnasi Abío, Morgan Deters, Robert Nieuwenhuis, Peter J. Stuckey. 273-286 [doi]
- Generating Diverse Solutions in SATAlexander Nadel. 287-301 [doi]
- Captain Jack: New Variable Selection Heuristics in Local Search for SATDave A. D. Tompkins, Adrian Balint, Holger H. Hoos. 302-316 [doi]
- Careful Ranking of Multiple Solvers with Timeouts and TiesAllen Van Gelder. 317-328 [doi]
- Generalized Conflict-Clause Strengthening for Satisfiability SolversAllen Van Gelder. 329-342 [doi]
- Empirical Study of the Anatomy of Modern Sat SolversHadi Katebi, Karem A. Sakallah, João P. Marques Silva. 343-356 [doi]
- Translating Pseudo-Boolean Constraints into CNFAmir Aavani. 357-359 [doi]
- Analyzing the Instances of the MaxSAT EvaluationJosep Argelich, Chu Min Li, Felip Manyà, Jordi Planes. 360-361 [doi]
- Model Counting Using the Inclusion-Exclusion PrincipleHuxley Bennett, Sriram Sankaranarayanan. 362-363 [doi]
- Phase Transitions in Knowledge Compilation: An Experimental StudyJian Gao, Minghao Yin, Ke Xu. 364-366 [doi]
- EagleUP: Solving Random 3-SAT Using SLS with Unit PropagationOliver Gableske, Marijn Heule. 367-368 [doi]
- Non-Model-Based Algorithm Portfolios for SATYuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann. 369-370 [doi]
- The Order Encoding: From Tractable CSP to Tractable SATJustyna Petke, Peter Jeavons. 371-372 [doi]
- Applying UCT to Boolean SatisfiabilityAlessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman. 373-374 [doi]
- A Compact and Efficient SAT-Encoding of Finite Domain CSPTomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara. 375-376 [doi]
- Learning Polarity from Structure in SATBryan Silverthorn, Risto Miikkulainen. 377-378 [doi]