Abstract is missing.
- SAT Modulo Theories: Enhancing SAT with Special-Purpose AlgorithmsRobert Nieuwenhuis. 1 [doi]
- Symbolic Techniques in Propositional Satisfiability SolvingMoshe Y. Vardi. 2-3 [doi]
- Efficiently Calculating Evolutionary Tree Measures Using SATMaria Luisa Bonet, Katherine St. John. 4-17 [doi]
- Finding Lean Induced Cycles in Binary HypercubesYury Chebiryak, Thomas Wahl, Daniel Kroening, Leopold Haller. 18-31 [doi]
- Finding Efficient Circuits Using SAT-SolversArist Kojevnikov, Alexander S. Kulikov, Grigory Yaroslavtsev. 32-44 [doi]
- Encoding Treewidth into SATMarko Samer, Helmut Veith. 45-50 [doi]
- The Complexity of Reasoning for Fragments of Default LogicOlaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer. 51-64 [doi]
- Does Advice Help to Prove Propositional Tautologies?Olaf Beyersdorff, Sebastian Müller. 65-72 [doi]
- Backdoors in the Context of LearningBistra N. Dilkina, Carla P. Gomes, Ashish Sabharwal. 73-79 [doi]
- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable OccurrencesDaniel Johannsen, Igor Razgon, Magnus Wahlström. 80-85 [doi]
- On Some Aspects of Mixed Horn FormulasStefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer. 86-100 [doi]
- Variable Influences in Conjunctive Normal FormsPatrick Traxler. 101-113 [doi]
- Clause-Learning Algorithms with Many Restarts and Bounded-Width ResolutionAlbert Atserias, Johannes Klaus Fichte, Marc Thurley. 114-127 [doi]
- An Exponential Lower Bound for Width-Restricted Clause LearningJan Johannsen. 128-140 [doi]
- Improved Conflict-Clause Minimization Leads to Improved Propositional Proof TracesAllen Van Gelder. 141-146 [doi]
- Boundary Points and ResolutionEugene Goldberg. 147-160 [doi]
- Sequential Encodings from Max-CSP into Partial Max-SATJosep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà. 161-166 [doi]
- Cardinality Networks and Their ApplicationsRoberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell. 167-180 [doi]
- New Encodings of Pseudo-Boolean Constraints into CNFOlivier Bailleux, Yacine Boufkhad, Olivier Roussel. 181-194 [doi]
- Efficient Term-ITE Conversion for Satisfiability Modulo TheoriesHyondeuk Kim, Fabio Somenzi, HoonSang Jin. 195-208 [doi]
- On-the-Fly Clause ImprovementHyoJung Han, Fabio Somenzi. 209-222 [doi]
- Dynamic Symmetry Breaking by Simulating Zykov ContractionBas Schaafsma, Marijn Heule, Hans van Maaren. 223-236 [doi]
- Minimizing Learned ClausesNiklas Sörensson, Armin Biere. 237-243 [doi]
- Extending SAT Solvers to Cryptographic ProblemsMate Soos, Karsten Nohl, Claude Castelluccia. 244-257 [doi]
- Improving Variable Selection Process in Stochastic Local Search for Propositional SatisfiabilityAnton Belov, Zbigniew Stachniak. 258-264 [doi]
- A Theoretical Analysis of Search in GSATEvgeny S. Skvortsov. 265-275 [doi]
- The Parameterized Complexity of k-Flip Local Search for SAT and MAX SATStefan Szeider. 276-283 [doi]
- A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability ProblemAdrian Balint, Michael Henn, Oliver Gableske. 284-297 [doi]
- Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning TechniquesJingchao Chen. 298-311 [doi]
- Restart Strategy Selection Using Machine Learning TechniquesShai Haim, Toby Walsh. 312-325 [doi]
- Instance-Based Selection of Policies for SAT SolversMladen Nikolic, Filip Maric, Predrag Janicic. 326-340 [doi]
- Width-Based Restart Policies for Clause-Learning Satisfiability SolversKnot Pipatsrisawat, Adnan Darwiche. 341-355 [doi]
- Problem-Sensitive Restart Heuristics for the DPLL ProcedureCarsten Sinz, Markus Iser. 356-362 [doi]
- (1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions MechanismsNadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol. 363-376 [doi]
- VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL SearchEric I. Hsu, Sheila A. McIlraith. 377-390 [doi]
- Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and CircuitsHans Kleine Büning, Xishun Zhao, Uwe Bubeck. 391-397 [doi]
- A Compact Representation for Syntactic Dependencies in QBFsFlorian Lonsing, Armin Biere. 398-411 [doi]
- Beyond CNF: A Circuit-Based QBF SolverAlexandra Goultiaeva, Vicki Iverson, Fahiem Bacchus. 412-426 [doi]
- Solving (Weighted) Partial MaxSAT through Satisfiability TestingCarlos Ansótegui, Maria Luisa Bonet, Jordi Levy. 427-440 [doi]
- Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?Timo Berthold, Stefan Heinz, Marc E. Pfetsch. 441-446 [doi]
- Relaxed DPLL Search for MaxSATLukas Kroc, Ashish Sabharwal, Bart Selman. 447-452 [doi]
- Branch and Bound for Boolean Optimization and the Generation of Optimality CertificatesJavier Larrosa, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell. 453-466 [doi]
- Exploiting Cycle Structures in Max-SATChu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes. 467-480 [doi]
- Generalizing Core-Guided Max-SATMark H. Liffiton, Karem A. Sakallah. 481-494 [doi]
- Algorithms for Weighted Boolean OptimizationVasco M. Manquinho, João P. Marques Silva, Jordi Planes. 495-508 [doi]
- PaQuBE: Distributed QBF Solving with Advanced Knowledge SharingMatthew D. T. Lewis, Paolo Marin, Tobias Schubert, Massimo Narizzano, Bernd Becker, Enrico Giunchiglia. 509-523 [doi]
- c-sat: A Parallel SAT Solver for ClustersKei Ohmura, Kazunori Ueda. 524-537 [doi]