Abstract is missing.
- Modelling Max-CSP as Partial Max-SATJosep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà. 1-14 [doi]
- A Preprocessor for Max-SAT SolversJosep Argelich, Chu Min Li, Felip Manyà. 15-20 [doi]
- A Generalized Framework for Conflict AnalysisGilles Audemard, Lucas Bordeaux, Youssef Hamadi, Saïd Jabbour, Lakhdar Sais. 21-27 [doi]
- Adaptive Restart Strategies for Conflict Driven SAT SolversArmin Biere. 28-33 [doi]
- New Results on the Phase Transition for Random Quantified Boolean FormulasNadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol. 34-47 [doi]
- Designing an Efficient Hardware Implication Accelerator for SAT SolvingJohn D. Davis, Zhangxi Tan, Fang Yu, Lintao Zhang. 48-62 [doi]
- Attacking Bivium Using SAT SolversTobias Eibach, Enrico Pilz, Gunnar Völkel. 63-76 [doi]
- SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial SolversGermain Faure, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell. 77-90 [doi]
- Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and AlgorithmsYong Gao. 91-104 [doi]
- Complexity and Algorithms for Well-Structured k-SAT InstancesKonstantinos Georgiou, Periklis A. Papakonstantinou. 105-118 [doi]
- A Decision-Making Procedure for Resolution-Based SAT-SolversEugene Goldberg. 119-132 [doi]
- Online Estimation of SAT Solving RuntimeShai Haim, Toby Walsh. 133-138 [doi]
- A Max-SAT Inference-Based Pre-processing for Max-CliqueFederico Heras, Javier Larrosa. 139-152 [doi]
- SAT, UNSAT and ColoringKazuo Iwama. 153 [doi]
- Computation of Renameable Horn BackdoorsStephan Kottler, Michael Kaufmann, Carsten Sinz. 154-160 [doi]
- A New Bound for an NP-Hard Subclass of 3-SAT Using BackdoorsStephan Kottler, Michael Kaufmann, Carsten Sinz. 161-167 [doi]
- Improvements to Hybrid Incremental SAT AlgorithmsFlorian Letombe, João Marques-Silva. 168-181 [doi]
- Searching for Autarkies to Trim Unsatisfiable Clause SetsMark H. Liffiton, Karem A. Sakallah. 182-195 [doi]
- Nenofex: Expanding NNF for QBF SolvingFlorian Lonsing, Armin Biere. 196-210 [doi]
- SAT(ID): Satisfiability of Propositional Logic Extended with Inductive DefinitionsMaarten Mariën, Johan Wittocx, Marc Denecker, Maurice Bruynooghe. 211-224 [doi]
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability AlgorithmsJoão Marques-Silva, Vasco M. Manquinho. 225-230 [doi]
- A CNF Class Generalizing Exact Linear FormulasStefan Porschen, Ewald Speckenmeyer. 231-245 [doi]
- How Many Conflicts Does It Need to Be Unsatisfiable?Dominik Scheder, Philipp Zumstein. 246-256 [doi]
- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause LearningZbigniew Stachniak, Anton Belov. 257-270 [doi]
- Local RestartsVadim Ryvchin, Ofer Strichman. 271-276 [doi]
- Regular and General Resolution: An Improved SeparationAlasdair Urquhart. 277-290 [doi]
- Finding Guaranteed MUSes FastHans van Maaren, Siert Wieringa. 291-304 [doi]