Abstract is missing.
- SAT: Past and FutureMartin Davis. 1-2 [doi]
- Encodings of Problems in Effectively Propositional LogicJuan Antonio Navarro Pérez, Andrei Voronkov. 3 [doi]
- Efficient Circuit to CNF ConversionPanagiotis Manolios, Daron Vroon. 4-9 [doi]
- Mapping CSP into Many-Valued SATCarlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà. 10-15 [doi]
- Circuit Based Encoding of CNF FormulaGilles Audemard, Lakhdar Sais. 16-21 [doi]
- Breaking Symmetries in SAT Matrix ModelsInês Lynce, João P. Marques Silva. 22-27 [doi]
- Partial Max-SAT Solvers with Clause LearningJosep Argelich, Felip Manyà. 28-40 [doi]
- MiniMaxSat: A New Weighted Max-SAT SolverFederico Heras, Javier Larrosa, Albert Oliveras. 41-55 [doi]
- Solving Multi-objective Pseudo-Boolean ProblemsMartin Lukasiewycz, Michael Glaß, Christian Haubelt, Jürgen Teich. 56-69 [doi]
- Improved Lower Bounds for Tree-Like Resolution over Linear InequalitiesArist Kojevnikov. 70-79 [doi]
- Horn Upper Bounds and RenamingMarina Langlois, Robert H. Sloan, György Turán. 80-93 [doi]
- Matched Formulas and Backdoor SetsStefan Szeider. 94-99 [doi]
- Short XORs for Model Counting: From Theory to PracticeCarla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman. 100-106 [doi]
- Variable Dependency in Local Search: Prevention Is Better Than CureSteven David Prestwich. 107-120 [doi]
- Combining Adaptive Noise and Look-Ahead in Local Search for SATChu Min Li, Wanxia Wei, Harry Zhang. 121-133 [doi]
- From Idempotent Generalized Boolean Assignments to Multi-bit SearchMarijn Heule, Hans van Maaren. 134-147 [doi]
- Satisfiability with Exponential FamiliesDominik Scheder, Philipp Zumstein. 148-158 [doi]
- Formalizing Dangerous SAT EncodingsAlexander Hertel, Philipp Hertel, Alasdair Urquhart. 159-172 [doi]
- Algorithms for Variable-Weighted 2-SAT and Dual ProblemsStefan Porschen, Ewald Speckenmeyer. 173-186 [doi]
- On the Boolean Connectivity Problem for Horn RelationsKazuhisa Makino, Suguru Tamaki, Masaki Yamamoto. 187-200 [doi]
- A First Step Towards a Unified Proof Checker for QBFToni Jussila, Armin Biere, Carsten Sinz, Daniel Kröning, Christoph M. Wintersteiger. 201-214 [doi]
- Dynamically Partitioning for Solving QBFHorst Samulowitz, Fahiem Bacchus. 215-229 [doi]
- Backdoor Sets of Quantified Boolean FormulasMarko Samer, Stefan Szeider. 230-243 [doi]
- Bounded Universal Expansion for Preprocessing QBFUwe Bubeck, Hans Kleine Büning. 244-257 [doi]
- Effective Incorporation of Double Look-Ahead ProceduresMarijn Heule, Hans van Maaren. 258-271 [doi]
- Applying Logic Synthesis for Speeding Up SATNiklas Eén, Alan Mishchenko, Niklas Sörensson. 272-286 [doi]
- Towards a Better Understanding of the Functionality of a Conflict-Driven SAT SolverNachum Dershowitz, Ziyad Hanna, Alexander Nadel. 287-293 [doi]
- A Lightweight Component Caching Scheme for Satisfiability SolversKnot Pipatsrisawat, Adnan Darwiche. 294-299 [doi]
- Minimum 2CNF Resolution Refutations in Polynomial TimeJoshua Buresh-Oppenheim, David G. Mitchell. 300-313 [doi]
- Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular MatricesOliver Kullmann. 314-327 [doi]
- Verifying Propositional Unsatisfiability: Pitfalls to AvoidAllen Van Gelder. 328-333 [doi]
- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo TheoriesAlessandro Cimatti, Alberto Griggio, Roberto Sebastiani. 334-339 [doi]
- SAT Solving for Termination Analysis with Polynomial InterpretationsCarsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl. 340-354 [doi]
- Fault Localization and Correction with QBFStefan Staber, Roderick Bloem. 355-368 [doi]
- Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based ApproachFadi A. Aloul, Nagarajan Kandasamy. 369-376 [doi]
- Inversion Attacks on Secure Hash Functions Using satSolversDebapratim De, Abishek Kumarasubramanian, Ramarathnam Venkatesan. 377-382 [doi]