Abstract is missing.
- Mapping Problems with Finite-Domain Variables to Problems with Boolean VariablesCarlos Ansótegui, Felip Manyà. 1-15 [doi]
- A SAT-Based Decision Procedure for the Boolean Combination of Difference ConstraintsAlessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea. 16-29 [doi]
- An Algebraic Approach to the Complexity of Generalized Conjunctive QueriesMichael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer. 30-45 [doi]
- Incremental Compilation-to-SAT ProceduresMarco Benedetti, Sara Bernardini. 46-58 [doi]
- Resolve and ExpandArmin Biere. 59-70 [doi]
- Looking Algebraically at Tractable Quantified Boolean FormulasHubie Chen, Víctor Dalmau. 71-79 [doi]
- Derandomization of Schuler s Algorithm for SATEvgeny Dantsin, Alexander Wolpert. 80-88 [doi]
- Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian RankNicola Galesi, Oliver Kullmann. 89-104 [doi]
- QBF Reasoning on Real-World InstancesEnrico Giunchiglia, Massimo Narizzano, Armando Tacchella. 105-121 [doi]
- Automatic Extraction of Functional DependenciesÉric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Sais. 122-132 [doi]
- Algorithms for Satisfiability Using Independent Sets of VariablesRavi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy. 133-144 [doi]
- Aligning CNF- and Equivalence-ReasoningMarijn Heule, Hans van Maaren. 145-156 [doi]
- Using DPLL for Efficient OBDD ConstructionJinbo Huang, Adnan Darwiche. 157-172 [doi]
- Approximation Algorithm for Random MAX- ::::k::::SATYannet Interian. 173-182 [doi]
- Clause Form Conversions for Boolean CircuitsPaul Jackson, Daniel Sheridan. 183-198 [doi]
- From Spin Glasses to Hard Satisfiable FormulasHaixia Jia, Cristopher Moore, Bart Selman. 199-210 [doi]
- CirCUs: A Hybrid Satisfiability SolverHoonSang Jin, Fabio Somenzi. 211-223 [doi]
- Equivalence Models for Quantified Boolean FormulasHans Kleine Büning, Xishun Zhao. 224-234 [doi]
- Search vs. Symbolic Techniques in Satisfiability SolvingGuoqiang Pan, Moshe Y. Vardi. 235-250 [doi]
- Worst Case Bounds for Some NP-Complete Modified Horn-SAT ProblemsStefan Porschen, Ewald Speckenmeyer. 251-262 [doi]
- Satisfiability Threshold of the Skewed Random ::::k::::-SATDanila A. Sinopalnikov. 263-275 [doi]
- NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT InstancesSathiamoorthy Subbarayan, Dhiraj K. Pradhan. 276-291 [doi]
- Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter ProblemsDaijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik. 292-305 [doi]
- UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SATDave A. D. Tompkins, Holger H. Hoos. 306-320 [doi]
- Fifty-Five Solvers in Vancouver: The SAT 2004 CompetitionDaniel Le Berre, Laurent Simon. 321-344 [doi]
- March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT SolverMarijn Heule, Mark Dufour, Joris van Zwieten, Hans van Maaren. 345-359 [doi]
- Zchaff2004: An Efficient SAT SolverYogesh S. Mahajan, Zhaohui Fu, Sharad Malik. 360-375 [doi]
- The Second QBF Solvers Comparative EvaluationDaniel Le Berre, Massimo Narizzano, Laurent Simon, Armando Tacchella. 376-392 [doi]