Abstract is missing.
- From Propositional Satisfiability to Satisfiability Modulo TheoriesHossein M. Sheini, Karem A. Sakallah. 1-9 [doi]
- CSPs: Adding Structure to SATFahiem Bacchus. 10-10 [doi]
- Complexity of Semialgebraic Proofs with Restricted Degree of FalsityArist Kojevnikov, Alexander S. Kulikov. 11-21 [doi]
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean KernelOliver Kullmann, Inês Lynce, João Marques-Silva. 22-35 [doi]
- A Scalable Algorithm for Minimal Unsatisfiable Core ExtractionNachum Dershowitz, Ziyad Hanna, Alexander Nadel. 36-41 [doi]
- Minimum Witnesses for Unsatisfiable 2CNFsJoshua Buresh-Oppenheim, David G. Mitchell. 42-47 [doi]
- Preliminary Report on Input Cover Number as a Metric for Propositional Resolution ProofsAllen Van Gelder. 48-53 [doi]
- Extended Resolution Proofs for Symbolic SAT Solving with QuantificationToni Jussila, Carsten Sinz, Armin Biere. 54-60 [doi]
- Encoding CNFs to Empower Component AnalysisMark Chavira, Adnan Darwiche. 61-74 [doi]
- Satisfiability Checking of Non-clausal Formulas Using General MatingsHimanshu Jain, Constantinos Bartzis, Edmund M. Clarke. 75-89 [doi]
- Determinization of Resolution by an Algorithm Operating on Complete AssignmentsEugene Goldberg. 90-95 [doi]
- A Complete Random Jump Strategy with Guiding PathsHantao Zhang. 96-101 [doi]
- Applications of SAT Solvers to Cryptanalysis of Hash FunctionsIlya Mironov, Lintao Zhang. 102-115 [doi]
- Functional Treewidth: Bounding Complexity in the Presence of Functional DependenciesYuliya Zabiyaka, Adnan Darwiche. 116-129 [doi]
- Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ALCRoberto Sebastiani, Michele Vescovi. 130-135 [doi]
- SAT in Bioinformatics: Making the Case with Haplotype InferenceInês Lynce, João Marques-Silva. 136-141 [doi]
- Lemma Learning in SMT on Linear ConstraintsYinlei Yu, Sharad Malik. 142-155 [doi]
- On SAT Modulo Theories and Optimization ProblemsRobert Nieuwenhuis, Albert Oliveras. 156-169 [doi]
- Fast and Flexible Difference Constraint Propagation for DPLL(T)Scott Cotton, Oded Maler. 170-183 [doi]
- A Progressive Simplifier for Satisfiability Modulo TheoriesHossein M. Sheini, Karem A. Sakallah. 184-197 [doi]
- Dependency Quantified Horn Formulas: Models and ComplexityUwe Bubeck, Hans Kleine Büning. 198-211 [doi]
- On Linear CNF FormulasStefan Porschen, Ewald Speckenmeyer, Bert Randerath. 212-225 [doi]
- A Dichotomy Theorem for Typed Constraint Satisfaction ProblemsSu Chen, Tomasz Imielinski, Karin Johnsgard, Donald Smith, Mario Szegedy. 226-239 [doi]
- A Complete Calculus for Max-SATMaria Luisa Bonet, Jordi Levy, Felip Manyà. 240-251 [doi]
- On Solving the Partial MAX-SAT ProblemZhaohui Fu, Sharad Malik. 252-265 [doi]
- MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s:::2:::) TimeEvgeny Dantsin, Alexander Wolpert. 266-276 [doi]
- Average-Case Analysis for the MAX-2SAT ProblemOsamu Watanabe, Masaki Yamamoto. 277-282 [doi]
- Local Search for UnsatisfiabilitySteven David Prestwich, Inês Lynce. 283-296 [doi]
- Efficiency of Local SearchAndrei A. Bulatov, Evgeny S. Skvortsov. 297-310 [doi]
- Implementing Survey Propagation on Graphics Processing UnitsPanagiotis Manolios, Yimin Zhang. 311-324 [doi]
- Characterizing Propagation Methods for Boolean SatisfiabilityEric I. Hsu, Sheila A. McIlraith. 325-338 [doi]
- Minimal False Quantified Boolean FormulasHans Kleine Büning, Xishun Zhao. 339-352 [doi]
- Binary Clause Reasoning in QBFHorst Samulowitz, Fahiem Bacchus. 353-367 [doi]
- Solving Quantified Boolean Formulas with Circuit Observability Don t CaresDaijue Tang, Sharad Malik. 368-381 [doi]
- QBF Modeling: Exploiting Player Symmetry for Simplicity and EfficiencyAshish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman. 382-395 [doi]
- Solving #SAT Using Vertex CoversNaomi Nishimura, Prabhakar Ragde, Stefan Szeider. 396-409 [doi]
- Counting Models in Integer DomainsAntónio Morgado, Paulo J. Matos, Vasco M. Manquinho, João P. Marques Silva. 410-423 [doi]
- sharpSAT - Counting Models with Advanced Component Caching and Implicit BCPMarc Thurley. 424-429 [doi]
- A Distribution Method for Solving SAT in GridsAntti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä. 430-435 [doi]